Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
From MaRDI portal
Publication:1756757
DOI10.1007/S10898-018-0638-XzbMATH Open1414.90234OpenAlexW2793304285WikidataQ130126072 ScholiaQ130126072MaRDI QIDQ1756757FDOQ1756757
Adriana Cristina Cherri, Luiz H. Cherri, E. Soler
Publication date: 21 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11449/160523
Cites Work
- A 2-exchange heuristic for nesting problems
- Mathematical model and efficient algorithms for object packing problem
- Mixed-integer programming models for nesting problems
- The geometry of nesting problems: a tutorial
- Cutting circles and polygons from area-minimizing rectangles
- Optimal clustering of a pair of irregular objects
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Optimal packing and covering in the plane are NP-complete
- Solving nesting problems with non-convex polygons by constraint logic programming
- A fully general, exact algorithm for nesting irregular shapes
Cited In (7)
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- A clique covering MIP model for the irregular strip packing problem
- Irregular packing problems: a review of mathematical models
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- 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
- Decomposition Algorithm for Irregular Placement Problems
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem π π
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming π π
- Robust mixed-integer linear programming models for the irregular strip packing problem π π
- Solving the irregular strip packing problem via guided local search for overlap minimization π π
- A clique covering MIP model for the irregular strip packing problem π π
- A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems π π
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects π π
This page was built for publication: Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756757)