Orientational variable-length strip covering problem: a branch-and-price-based algorithm
From MaRDI portal
Publication:2028818
DOI10.1016/j.ejor.2020.07.003zbMath1487.90555OpenAlexW3042032944MaRDI QIDQ2028818
Waiming Zhu, Bo An, Yi Wu, Yanling Zhi, Hua-Wei Ma, Xiao-xuan Hu
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.003
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Uses Software
Cites Work
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Optimal circle covering problems and their applications
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Robust mixed-integer linear programming models for the irregular strip packing problem
- An algorithm for approximating the Pareto set of the multiobjective set covering problem
- A heuristic approach for packing identical rectangles in convex regions
- Covering a square of side \(n+\varepsilon\) with unit squares
- Compact packings of the plane with two sizes of discs
- The capacitated maximal covering location problem with backup service
- On packing squares with equal squares
- The gradual covering decay location problem on a network.
- A method of optimal lattice packing of congruent oriented polygons in the plane
- Covering squares with squares
- Intelligent-guided adaptive search for the maximum covering location problem
- A clique covering MIP model for the irregular strip packing problem
- The connected disk covering problem
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
- A tolerance function for the multiobjective set covering problem
- Matheuristics for the irregular bin packing problem with free rotations
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A constructive proof of swap local search worst-case instances for the maximum coverage problem
- Raster penetration map applied to the irregular packing problem
- Determining optimal police patrol areas with maximal covering and backup covering location models
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Disk Packing in a Square: A New Global Optimization Approach
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- Solving Nonlinear Covering Problems Arising in WLAN Design
- A Kind of Triangle Covering and Packing Problem
- The Probabilistic Set-Covering Problem
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- Covering Rectilinear Polygons with Axis-Parallel Rectangles
- The Maximum Availability Location Problem
- Beyond Triangulation: Covering Polygons with Triangles
- A Primer in Column Generation
- Branch-and-Bound Methods: A Survey
- Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
- The generalized maximal covering location problem
