New filtering for the cumulative constraint in the context of non-overlapping rectangles

DOI10.1007/s10479-010-0731-0zbMath1214.90100OpenAlexW2013425250MaRDI QIDQ545536

Emmanuel Poder, Mats Carlsson, Sophie Demassey, Nicolas Beldiceanu

Publication date: 22 June 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0731-0

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

LP bounds in various constraint programming approaches for orthogonal packing

Uses Software

• CHIP

Cites Work

• Unnamed Item
• Unnamed Item
• Object-oriented interaction in resource constrained scheduling
• Introducing global constraints in CHIP
• Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
• 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 cumulative constraint in the context of non-overlapping rectangles