Sciweavers

MP
2010
116views more  MP 2010»
13 years 9 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
INFORMS
2007
62views more  INFORMS 2007»
13 years 11 months ago
On a Binary-Encoded ILP Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an effici...
Jon Lee, François Margot