New filtering for the cumulative constraint in the context of non-overlapping rectangles
From MaRDI portal
(Redirected from Publication:545536)
Recommendations
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- New filtering algorithms for combinations of among constraints
- A quadratic edge-finding filtering algorithm for cumulative resource constraints
- scientific article; zbMATH DE number 2084705
- The Offset Filtration of Convex Objects
- scientific article; zbMATH DE number 1947448
- scientific article; zbMATH DE number 2084719
- scientific article; zbMATH DE number 2084718
Cites work
- scientific article; zbMATH DE number 3782375 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A dynamic programming approach for consistency and propagation for knapsack constraints
- 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
- Exhaustive approaches to 2D rectangular perfect packings
- Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
- Introducing global constraints in CHIP
- Object-oriented interaction in resource constrained scheduling
Cited in
(5)- scientific article; zbMATH DE number 2084705 (Why is no real title available?)
- scientific article; zbMATH DE number 2084718 (Why is no real title available?)
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- LP bounds in various constraint programming approaches for orthogonal packing
- A quadratic edge-finding filtering algorithm for cumulative resource constraints
This page was built for publication: New filtering for the cumulative constraint in the context of non-overlapping rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545536)
