Sciweavers

ENDM
2010
115views more  ENDM 2010»
13 years 8 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 11 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter