Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
From MaRDI portal
Publication:5713868
DOI10.1007/b96957zbMath1094.90559OpenAlexW2498803556MaRDI QIDQ5713868
Christos T. Maravelias, Ignacio E. Grossmann
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
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 (7)
Constraint programming and operations research ⋮ An integrated method for planning and scheduling to minimize tardiness ⋮ Single-facility scheduling by logic-based Benders decomposition ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ The Benders decomposition algorithm: a literature review ⋮ MILP-based campaign scheduling in a specialty chemicals plant: a case study ⋮ Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
This page was built for publication: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
