找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Operations Research Proceedings 2007; Selected Papers of t Jörg Kalcsics,Stefan Nickel Conference proceedings 2008 Springer-Verlag Berlin H

[复制链接]
楼主: nourish
发表于 2025-3-23 12:39:43 | 显示全部楼层
Senay Solak,John-Paul Clarke,Ellis Johnson,Earl Barnes
发表于 2025-3-23 15:23:25 | 显示全部楼层
Expected Additive Time-Separable Utility Maximizing Capacity Control in Revenue ManagementWe briefly discuss the static capacity control problem from the perspective of an expected utility maximizing decision-maker with an additive time-separable utility function. Differences to the expected revenue maximizing case are demonstrated by means of an example.
发表于 2025-3-23 19:54:17 | 显示全部楼层
Heuristics of the Branch-Cut-and-Price-Framework SCIPIn this paper we give an overview of the heuristics which are integrated into the open source branch-cut-and-price-framework SCIP. We briefly describe the fundamental ideas of different categories of heuristics and present some computational results which demonstrate the impact of heuristics on the overall solving process of SCIP.
发表于 2025-3-24 00:53:45 | 显示全部楼层
Optimal Control Strategies for Incoming InspectionAcceptance sampling is one important part of logistic processes and production. Because of that, we developed a new model, named DMGI (Dynamic Mixed Goods Inspection) which uses past inspections in order to support companies deciding which delivery should be inspected in goods income.
发表于 2025-3-24 04:32:36 | 显示全部楼层
发表于 2025-3-24 06:54:29 | 显示全部楼层
Jörg Kalcsics,Stefan NickelIncludes supplementary material:
发表于 2025-3-24 13:54:03 | 显示全部楼层
978-3-540-77902-5Springer-Verlag Berlin Heidelberg 2008
发表于 2025-3-24 15:42:17 | 显示全部楼层
发表于 2025-3-24 20:35:02 | 显示全部楼层
Routing and Capacity Optimization for IP Networksdata transmission. Shortest path routing protocol such as OSPF or IS-IS control the traffic flow within most of these networks. The network administrator can manage the routing in these networks only by supplying a so-called ., which specifies the link lengths (or routing weights) used in the shortest path computation.
发表于 2025-3-25 01:31:14 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-19 05:25
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表