Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

DOI10.1007/11757375zbMATH Open1177.90292OpenAlexW4298795079MaRDI QIDQ5898786FDOQ5898786

Authors: Radu Marinescu, Rina Dechter 

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11757375

Recommendations

• Best-First AND/OR Search for 0/1 Integer Programming
• 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
• Resolution search and dynamic branch-and-bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Cited In (9)

• Title not available (Why is that?)
• Evaluating the impact of AND/OR search on 0-1 integer linear programming
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
• Best-First AND/OR Search for 0/1 Integer Programming
• Title not available (Why is that?)
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Principles and Practice of Constraint Programming – CP 2004

Uses Software

• MIPLIB

This page was built for publication: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

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