Mixed-integer programming models for nesting problems
From MaRDI portal
Recommendations
- Irregular packing problems: a review of mathematical models
- Approximate packing: integer programming models, valid inequalities and nesting
- scientific article; zbMATH DE number 1313602
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- Irregular packing: MILP model based on a polygonal enclosure
Cites work
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Compaction and separation algorithms for non-convex polygons and their applications
- Fast neighborhood search for two- and three-dimensional nesting problems
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Packing small boxes into a big box.
- Solution approaches to irregular nesting problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Solving the irregular strip packing problem via guided local search for overlap minimization
Cited in
(29)- Cutting circles and polygons from area-minimizing rectangles
- Nesting planning based on production priorities and technological efficiency
- 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
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- 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
- A global optimization point of view to handle non-standard object packing problems
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Irregular packing problems: a review of mathematical models
- A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
- Irregular packing: MILP model based on a polygonal enclosure
- Packing problems in space solved by CPLEX: an experimental analysis
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Algorithms for nesting with defects
- Approximate packing: integer programming models, valid inequalities and nesting
- Solving nesting problems with non-convex polygons by constraint logic programming
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- 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
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- A 2D convex shapes bin packing problem in the production of laminated safety glass
- Using helical polyhedron for online irregular strip packing problem with free rotations
- Randomized greedy strategy with corner filling for the irregular 2D bin packing problem
- Mixed-integer linear programming models for 3D irregular strip packing problems
- A parallel branch-and-bound-and-check algorithm for nesting
This page was built for publication: Mixed-integer programming models for nesting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2271127)
