Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/b100482zbMath1152.68545OpenAlexW1508891358MaRDI QIDQ5900291

Pierre-Emmanuel Hladik, Narendra Jussien, Yvon Trinquet, Hadrien Cambazard, Anne-Marie Deplanche

Publication date: 9 September 2008

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

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Constraint programming and operations research, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, Identifying and exploiting problem structures using explanation-based constraint programming, Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling, Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity, Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition, Single-facility scheduling by logic-based Benders decomposition, A decomposition approach for solving a broadcast domination network design problem, Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire, Logic-Based Benders Decomposition for Large-Scale Optimization, Local search and constraint programming for the post enrolment-based course timetabling problem, Exact optimization and decomposition approaches for shelf space allocation, Strengthening of feasibility cuts in logic-based benders decomposition