A branch-and-cut algorithm for nesting problems with guillotine constraints
From MaRDI portal
Cites work
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A clique covering MIP model for the irregular strip packing problem
- A fully general, exact algorithm for nesting irregular shapes
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
- An improved typology of cutting and packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Cutting circles and polygons from area-minimizing rectangles
- Fast constructive and improvement heuristics for edge clique covering
- Irregular packing problems: a review of mathematical models
- Mathematical model and efficient algorithms for object packing problem
- 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
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Modeling of packing problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Multistage Cutting Stock Problems of Two and More Dimensions
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving nesting problems with non-convex polygons by constraint logic programming
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The geometry of nesting problems: a tutorial
This page was built for publication: A branch-and-cut algorithm for nesting problems with guillotine constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325197)
