Rectangle blanket problem: binary integer linear programming formulation and solution algorithms

DOI10.1016/j.ejor.2019.02.004zbMath1430.90422arXiv1910.01193OpenAlexW2911509058MaRDI QIDQ1735167

Xianqiang Yang

Publication date: 28 March 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.01193

zbMATH Keywords

heuristicsinteger programmingcomputer visionbranch-and-pricecutting /packing

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational issues in computer and robotic vision (65D19)

Related Items (1)

The board packing problem

Uses Software

• Gurobi
• OpenCV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust mixed-integer linear programming models for the irregular strip packing problem
• Algorithms for nesting with defects
• Covering a polygonal region by rectangles
• Tools of mathematical modeling of arbitrary object packing problems
• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• A minimax theorem on intervals
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Covering orthogonal polygons with star polygons: The perfect graph approach
• Simulated annealing with asymptotic convergence for nonlinear constrained optimization
• Solution approaches to irregular nesting problems
• Optimal packing and covering in the plane are NP-complete
• Cutting stock problems and solution procedures
• Polyominos and perfect graphs
• A typology of cutting and packing problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A population heuristic for constrained two-dimensional non-guillotine cutting
• \(\Phi\)-functions for complex 2D-objects
• Mixed-integer programming models for nesting problems
• The geometry of nesting problems: a tutorial
• An improved typology of cutting and packing problems
• Integer Programming
• Bounds for Two-Dimensional Cutting
• Reformulation and Decomposition of Integer Programs
• Computing Maximum-Scoring Segments in Almost Linear Time
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Totally-Balanced and Greedy Matrices
• Approximation schemes for covering and packing problems in image processing and VLSI
• Perfect Graphs and Orthogonally Convex Covers
• An Algorithm for Two-Dimensional Cutting Problems
• Covering Polygons Is Hard
• Covering Regions by Rectangles
• Reducibility among Combinatorial Problems
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• Implementing Mixed Integer Column Generation

This page was built for publication: Rectangle blanket problem: binary integer linear programming formulation and solution algorithms