New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles

DOI10.1007/978-3-540-68155-7_5zbMath1142.68505OpenAlexW2170035094MaRDI QIDQ5387618

Emmanuel Poder, Nicolas Beldiceanu, Mats Carlsson

Publication date: 27 May 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_5

Mathematics Subject Classification ID

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

Related Items (4)

Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ Conservative scales in packing problems ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems

Cites Work

• Unnamed Item
• Object-oriented interaction in resource constrained scheduling
• Introducing global constraints in CHIP
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Exhaustive approaches to 2D rectangular perfect packings
• A new constraint programming approach for the orthogonal packing problem
• A new exact method for the two-dimensional orthogonal packing problem
• Edge Finding for Cumulative Scheduling

This page was built for publication: New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles