Robust mixed-integer linear programming models for the irregular strip packing problem
From MaRDI portal
Publication:323210
DOI10.1016/J.EJOR.2016.03.009zbMATH Open1346.90626OpenAlexW2294646594MaRDI QIDQ323210FDOQ323210
Authors: Marina Andretta, Maria Antónia Carravilla, Leandro R. Mundim, Franklina M. B. Toledo, José Fernando Oliveira, Luiz H. Cherri 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.009
Recommendations
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
- A clique covering MIP model for the irregular strip packing problem
- Irregular packing: MILP model based on a polygonal enclosure
- Irregular packing problems: a review of mathematical models
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Cites Work
- Benchmarking optimization software with performance profiles.
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Mixed-integer programming models for nesting problems
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- An exact approach to the strip-packing problem
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- Solving the irregular strip packing problem via guided local search for overlap minimization
- Algorithms for nesting with defects
Cited In (25)
- Irregular packing: MILP model based on a polygonal enclosure
- Near optimal minimal convex hulls of disks
- A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Product packing and stacking under uncertainty: a robust approach
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
- A genetic algorithm for optimizing space utilization in aircraft hangar shop
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- A clique covering MIP model for the irregular strip packing problem
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
- Irregular packing problems: a review of mathematical models
- Raster penetration map applied to the irregular packing problem
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Parallel computing technologies for solving optimization problems of geometric design
- A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
- A customized branch-and-bound approach for irregular shape nesting
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
This page was built for publication: Robust mixed-integer linear programming models for the irregular strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323210)
