Mixed-integer programming models for nesting problems
From MaRDI portal
Publication:2271127
DOI10.1007/s10732-008-9088-9zbMath1172.90495OpenAlexW2072897920MaRDI QIDQ2271127
Publication date: 6 August 2009
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-008-9088-9
Mixed integer programming (90C11) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (17)
Robust mixed-integer linear programming models for the irregular strip packing problem ⋮ 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 ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations ⋮ Irregular packing problems: a review of mathematical models ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives ⋮ Irregular packing: MILP model based on a polygonal enclosure
Cites Work
- Unnamed Item
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- Packing small boxes into a big box.
- Fast neighborhood search for two- and three-dimensional nesting problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Solving the irregular strip packing problem via guided local search for overlap minimization
This page was built for publication: Mixed-integer programming models for nesting problems
