Models and bounds for two-dimensional level packing problems
From MaRDI portal
Recommendations
- Two-dimensional packing problems: a survey
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- An exact algorithm for the two-dimensional strip-packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
Cited in
(38)- An optimization algorithm for a penalized knapsack problem
- Two-dimensional knapsack-block packing problem
- Exact solution techniques for two-dimensional cutting and packing
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
- An exact method for the 2D guillotine strip packing problem
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- Creating worst-case instances for lower bounds of the 2D strip packing problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Characterization and modelling of guillotine constraints
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Triple-solution approach for the strip packing problem with two-staged patterns
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Models and heuristic algorithms for a weighted vertex coloring problem
- Models for two-dimensional bin packing problems with customer order spread
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- An improved typology of cutting and packing problems
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Two-dimensional packing problems: a survey
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- A GRASP-based approach for technicians and interventions scheduling for telecommunications
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- From High-Level Model to Branch-and-Price Solution in G12
- Packing squares independently
- An efficient deterministic optimization approach for rectangular packing problems
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Order and static stability into the strip packing problem
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Models and algorithms for three-stage two-dimensional bin packing
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
This page was built for publication: Models and bounds for two-dimensional level packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888172)
