Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
From MaRDI portal
Publication:5898786
DOI10.1007/11757375zbMath1177.90292OpenAlexW4298795079MaRDI QIDQ5898786
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (3)
Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques ⋮ 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
This page was built for publication: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
