Sciweavers

26 search results - page 3 / 6
» anor 2005
Sort
View
ANOR
2005
94views more  ANOR 2005»
13 years 10 months ago
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
Alper Atamtürk
ANOR
2005
89views more  ANOR 2005»
13 years 10 months ago
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
Sangbum Lee, Ignacio E. Grossmann
ANOR
2005
57views more  ANOR 2005»
13 years 10 months ago
Integer-Programming Software Systems
Recent developments in integer-programming software systems have tremendously improved our ability to solve large-scale instances. We review the major algorithmic components of sta...
Alper Atamtürk, Martin W. P. Savelsbergh
ANOR
2005
124views more  ANOR 2005»
13 years 10 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
ANOR
2005
98views more  ANOR 2005»
13 years 10 months ago
Condorcet Winners for Public Goods
In this work, we consider a public facility allocation problem decided through a voting process under the majority rule. A location of the public facility is a majority rule winner...
Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian