A clique covering MIP model for the irregular strip packing problem
From MaRDI portal
Publication:1652422
DOI10.1016/j.cor.2016.11.006zbMath1391.90391OpenAlexW2554681195MaRDI QIDQ1652422
Marcos Okamura Rodrigues, Franklina Maria Bragion Toledo
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.006
Mixed integer programming (90C11) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ 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 ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm ⋮ Irregular packing problems: a review of mathematical models ⋮ Exact approaches for the cutting path determination problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of edge coverings by cliques
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- A beam search implementation for the irregular shape packing problem
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Solution approaches to irregular nesting problems
- Optimal packing and covering in the plane are NP-complete
- On genetic algorithms for the packing of polygons
- Applied simulated annealing
- TOPOS -- A new constructive algorithm for nesting problems
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- An algorithm for polygon placement using a bottom-left strategy
- Mixed-integer programming models for nesting problems
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- The geometry of nesting problems: a tutorial
- A survey of local search methods for graph coloring
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A survey on vertex coloring problems
- Irregular Packing Using the Line and Arc No-Fit Polygon
- Jostling for position: local improvement for irregular cutting patterns
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A tutorial in irregular shape packing problems
- Solving the irregular strip packing problem via guided local search for overlap minimization
- A graph coloring algorithm for large scheduling problems
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Solving nesting problems with non-convex polygons by constraint logic programming
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Reducibility among Combinatorial Problems
- The Representation of a Graph by Set Intersections
This page was built for publication: A clique covering MIP model for the irregular strip packing problem
