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-first AND/OR search algorithms to solving 0-1 Integer Linear Programs (0-1 ILP) within this framework. We also include a class of dynamic variable ordering heuristics while exploring an AND/OR search tree for 0-1 ILPs. We demonstrate the effectiveness of these search algorithms on a variety of benchmarks, including real-world combinatorial auctions, random uncapacitated warehouse location problems and MAX-SAT instances.

• Type: Journal
• Year: 2010
• Where: CONSTRAINTS
• Authors: Radu Marinescu 0002, Rina Dechter
• Keywords: 0-1 Ilps, 0-1 Integer Linear, CONSTRAINTS 2010, Variable Ordering Heuristics