An efficient deterministic optimization approach for rectangular packing problems
From MaRDI portal
Recommendations
- Solving packing problems by a distributed global optimization algorithm
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- A novel non-linear approach to minimal area rectangular packing
- A finite method of searching for the global minimum of the rectangular packing problem
- Global optimization for the three-dimensional open-dimension rectangular packing problem
Cites work
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A fast algorithm for assortment optimization problems
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- A new heuristic algorithm for rectangle packing
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An improved typology of cutting and packing problems
- 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
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Exact and asymptotically exact solutions for a class of assortment problems
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Models and bounds for two-dimensional level packing problems
- Recent advances on two-dimensional bin packing problems
- Two-dimensional packing problems: a survey
Cited in
(16)- The rectangular packing problem: local optimum search methods based on block structures
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Solving packing problems by a distributed global optimization algorithm
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Deterministic model for customized pilot manufacture production with various backplane sizes
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- A finite method of searching for the global minimum of the rectangular packing problem
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- scientific article; zbMATH DE number 1225305 (Why is no real title available?)
- Applying spatial representation techniques to the container packing problem
- A distributed global optimization method for packing problems
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
- Efficient algorithms for orthogonal packing problems
- A novel non-linear approach to minimal area rectangular packing
- A dynamic packing approach for Internet-of-Things and logistics applications
This page was built for publication: An efficient deterministic optimization approach for rectangular packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868912)
