An efficient deterministic optimization approach for rectangular packing problems
From MaRDI portal
Publication:2868912
DOI10.1080/02331934.2011.625029zbMath1278.49041OpenAlexW2042098724MaRDI QIDQ2868912
Pei-Chun Wang, Jung-Fa Tsai, Ming-Hua Lin
Publication date: 19 December 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.625029
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (5)
A global optimization approach for solving three-dimensional open dimension rectangular packing problems ⋮ Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ 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
Cites Work
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Recent advances on two-dimensional bin packing problems
- A new heuristic algorithm for rectangle packing
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Two-dimensional packing problems: a survey
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Models and bounds for two-dimensional level packing problems
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A new exact method for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Exact and Asymptotically Exact Solutions for a Class of Assortment Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A fast algorithm for assortment optimization problems
This page was built for publication: An efficient deterministic optimization approach for rectangular packing problems
