A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
From MaRDI portal
Cites work
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A mixed-integer programming model for a class of assortment problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A set-covering-based heuristic approach for bin-packing problems
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- An approximately global optimization method for assortment problems
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- An exact approach to the strip-packing problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Characterization and modelling of guillotine constraints
- Exact solution techniques for two-dimensional cutting and packing
- scientific article; zbMATH DE number 2050771 (Why is no real title available?)
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Integer Programming Formulation of Traveling Salesman Problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Models and algorithms for three-stage two-dimensional bin packing
- Models and bounds for two-dimensional level packing problems
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Orthogonal Packings in Two Dimensions
- Scheduling inspired models for two-dimensional packing problems
- Strip based compact formulation for two-dimensional guillotine cutting problems
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
This page was built for publication: A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899146)
