A parallel branch-and-bound-and-check algorithm for nesting
From MaRDI portal
Cites work
- A 2-exchange heuristic for nesting problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- A class of facet producing graphs for vertex packing polyhedra
- A clique covering MIP model for the irregular strip packing problem
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- A graph coloring algorithm for large scheduling problems
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A Solution of the Rectangular Cutting-Stock Problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A tutorial in irregular shape packing problems
- A typology of cutting and packing problems
- An algebra of polygons through the notion of negative shapes
- An algorithm for polygon placement using a bottom-left strategy
- An improved method for calculating the no-fit polygon
- An improved typology of cutting and packing problems
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- Benchmarking optimization software with performance profiles.
- Compaction and separation algorithms for non-convex polygons and their applications
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Conflict analysis in mixed integer programming
- Conflict-Driven Heuristics for Mixed Integer Programming
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Exhaustive approaches to 2D rectangular perfect packings
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Fast constructive and improvement heuristics for edge clique covering
- scientific article; zbMATH DE number 2127464 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- IntSat: integer linear programming by conflict-driven constraint learning
- Irregular packing problems: a review of mathematical models
- Irregular packing using the line and arc no-fit polygon
- Large-scale clique cover of real-world networks
- Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
- Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
- Mixed integer programming: analyzing 12 years of progress
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Mixed-integer programming models for nesting problems
- Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
- Multistage Cutting Stock Problems of Two and More Dimensions
- On the facial structure of set packing polyhedra
- On the Set-Covering Problem
- Optimal packing and covering in the plane are NP-complete
- Packing problems
- Polygon decomposition for efficient construction of Minkowski sums
- Progress in mathematical programming solvers from 2001 to 2020
- Propagation via lazy clause generation
- Raster penetration map applied to the irregular packing problem
- Recent advances on two-dimensional bin packing problems
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Scheduling operating theatres: mixed integer programming vs. constraint programming
- Solution approaches to irregular nesting problems
- Solution of large-scale symmetric travelling salesman problems
- Solving Real-World Linear Programs: A Decade and More of Progress
- Strong lift-and-project cutting planes for the stable set problem
- The geometry of nesting problems: a tutorial
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- The nesting problem in the leather manufacturing industry
- The stable set problem: clique and nodal inequalities revisited
- Two approximate Minkowski sum algorithms
- Wheel inequalities for stable set polytopes
This page was built for publication: A parallel branch-and-bound-and-check algorithm for nesting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348390)
