Sciweavers

210 search results - page 13 / 42
» Error bounds for mixed integer linear optimization problems
Sort
View
EVOW
2007
Springer
15 years 3 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
ECAI
2010
Springer
14 years 10 months ago
LP Solvable Models for Multiagent Fair Allocation Problems
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...
Julien Lesca, Patrice Perny
IOR
2007
106views more  IOR 2007»
14 years 9 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
DATE
2009
IEEE
131views Hardware» more  DATE 2009»
15 years 26 days ago
Optimizations of an application-level protocol for enhanced dependability in FlexRay
FlexRay [9] is an automotive standard for high-speed and reliable communication that is being widely deployed for next generation cars. The protocol has powerful errordetection me...
Wenchao Li, Marco Di Natale, Wei Zheng, Paolo Gius...
SJ
2010
136views more  SJ 2010»
14 years 4 months ago
Optimizing the Migration to Future-Generation Passive Optical Networks (PON)
We study the upgrading problem of existing Passive Optical Networks (PONs) that need to increase their capacity at different points in time. Our method upgrades line rates and migr...
M. De Andrade, Massimo Tornatore, S. Sallent, Bisw...