Models for two-dimensional bin packing problems with customer order spread
From MaRDI portal
Recommendations
- Two-dimensional packing problems: a survey
- Models and algorithms for three-stage two-dimensional bin packing
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cites work
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved typology of cutting and packing problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- An integrated cutting stock and sequencing problem
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Exact solution techniques for two-dimensional cutting and packing
- Glass cutting in a small firm
- GRASP and path relinking for the matrix bandwidth minimization.
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Models and algorithms for three-stage two-dimensional bin packing
- Models and bounds for two-dimensional level packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- Packing small boxes into a big box.
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Recent advances on two-dimensional bin packing problems
- Sequential heuristic for the two-dimensional bin-packing problem
- Simulated annealing for order spread minimization in sequencing cutting patterns
- 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
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(1)
This page was built for publication: Models for two-dimensional bin packing problems with customer order spread
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621849)
