Sciweavers

327 search results - page 45 / 66
» Cutting planes in integer and mixed integer programming
Sort
View
EVOW
2007
Springer
15 years 7 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
INFOCOM
1998
IEEE
15 years 5 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
MP
1998
109views more  MP 1998»
15 years 1 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CP
2003
Springer
15 years 6 months ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
ICCSA
2005
Springer
15 years 6 months ago
An Economic Capacity Planning Model Considering Inventory and Capital Time Value
Abstract. A company needs to implement several make-to-stock policies apart from a regular make-to-order production, so that the capacity of expensive resources can be fully utiliz...
S. Michael Wang, Kung-Jeng Wang, Hui-Ming Wee, J. ...