Sciweavers

112 search results - page 11 / 23
» Lagrangian Relaxation
Sort
View
IPCO
2004
142views Optimization» more  IPCO 2004»
14 years 11 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
86
Voted
ANOR
2002
99views more  ANOR 2002»
14 years 9 months ago
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
Mark S. Daskin, Collette R. Coullard, Zuo-Jun Max ...
CPAIOR
2009
Springer
15 years 4 months ago
Sequencing and Counting with the multicost-regular Constraint
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
Julien Menana, Sophie Demassey
85
Voted
CPAIOR
2010
Springer
15 years 2 months ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
HICSS
1998
IEEE
169views Biometrics» more  HICSS 1998»
15 years 1 months ago
A Transmission-Constrained Unit Commitment Method
This paper presents a transmission-constrained unit commitment method using a Lagrangian relaxation approach. Based on a DC power flow model, the transmission constraints are form...
Chung-Li Tseng, Shmuel S. Oren, C. S. Cheng, C.-A....