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

DOI10.1007/b96957zbMath1094.90565OpenAlexW2498803556MaRDI QIDQ5713882

Pascal Van Hentenryck, Laurent Michel

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

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ Nondeterministic control for hybrid search ⋮ A constraint-based local search backend for MiniZinc ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ Control abstractions for local search

Uses Software

• SALSA
• COMET
• EasyLocal++
• Localizer

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