Sciweavers

6 search results - page 2 / 2
» On Lifting Integer Variables in Minimal Inequalities
Sort
View
IOR
2006
177views more  IOR 2006»
13 years 6 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti