Pages that link to "Item:Q2643952"
From MaRDI portal
The following pages link to A new exact method for the two-dimensional orthogonal packing problem (Q2643952):
Displaying 34 items.
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- New filtering for the cumulative constraint in the context of non-overlapping rectangles (Q545536) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- Optimal rectangle packing (Q610984) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- Rectangle packing with additional restrictions (Q650936) (← links)
- A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- The value of integrating loading and routing (Q1752774) (← links)
- MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
- A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
- A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- An efficient deterministic optimization approach for rectangular packing problems (Q2868912) (← links)
- MPQ-trees for orthogonal packing problem (Q2883589) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles (Q5387618) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5917883) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)