26 search results - page 3 / 6 » anor 2005 |
101
Voted
ANOR
2005
15 years 10 days ago
2005
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 ...
115
Voted
ANOR
2005
15 years 10 days ago
2005
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...
68
Voted
ANOR
2005
15 years 10 days ago
2005
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...
95
Voted
ANOR
2005
15 years 10 days ago
2005
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...
105
Voted
ANOR
2005
15 years 10 days ago
2005
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...