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

DOI10.1007/b96957zbMath1094.68645OpenAlexW2498803556MaRDI QIDQ5713870

Emmanuel Hebrard, Brahim Hnich, Toby Walsh

Publication date: 27 December 2005

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

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Super Solutions of Random Instances of Satisfiability ⋮ Multiconsistency and robustness with global constraints ⋮ Complexity study for the robust stable marriage problem ⋮ On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT ⋮ Reformulation based MaxSat robustness ⋮ A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming ⋮ A new branch-and-filter exact algorithm for binary constraint satisfaction problems ⋮ Super solutions of random \((3 + p)\)-SAT ⋮ Constraint solving in uncertain and dynamic environments: A survey

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