Best-First AND/OR Search for 0/1 Integer Programming

DOI10.1007/978-3-540-72397-4_13MaRDI QIDQ3612417zbMATH OpenOpenAlexFDO

Authors Radu Marinescu, Rina Dechter

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Evaluating the impact of AND/OR search on 0-1 integer linear programming
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• AND/OR search spaces for graphical models
• Memory intensive AND/OR search for combinatorial optimization in graphical models

Cited in

(8)

• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• A solution to the GHI problem for best-first search
• Subproblem ordering heuristics for AND/OR best-first search
• Evaluating the impact of AND/OR search on 0-1 integer linear programming
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
• Weighted heuristic anytime search: new schemes for optimization over graphical models
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Describes a project that uses

Uses Software

• MIPLIB
• PBS

This page was built for publication: Best-First AND/OR Search for 0/1 Integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612417)