Robust mixed-integer linear programming models for the irregular strip packing problem
From MaRDI portal
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
Cites work
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- Algorithms for nesting with defects
- An exact approach to the strip-packing problem
- An improved typology of cutting and packing problems
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Benchmarking optimization software with performance profiles.
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- Mixed-integer programming models for 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
- The geometry of nesting problems: a tutorial
Cited in
(32)- 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 family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Product packing and stacking under uncertainty: a robust approach
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- Near optimal minimal convex hulls of disks
- Parallel computing technologies for solving optimization problems of geometric design
- Irregular packing problems: a review of mathematical models
- A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
- Raster penetration map applied to the irregular packing problem
- Irregular packing: MILP model based on a polygonal enclosure
- A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- A genetic algorithm for optimizing space utilization in aircraft hangar shop
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- Using helical polyhedron for online irregular strip packing problem with free rotations
- Computing maximum polygonal packings in convex polygons using best-fit, genetic algorithms and ILPs (CG challenge)
- Mixed-integer linear programming models for 3D irregular strip packing problems
- A multi-objective evolutionary algorithm based on incremental support vector regression for the irregular strip packing problem
- A branch-and-cut algorithm for nesting problems with guillotine constraints
- A parallel branch-and-bound-and-check algorithm for nesting
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
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)
