Best-First AND/OR Search for 0/1 Integer Programming
From MaRDI portal
Publication:3612417
DOI10.1007/978-3-540-72397-4_13zbMath1214.90088OpenAlexW1621937717MaRDI QIDQ3612417
Publication date: 10 March 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_13
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models
Uses Software