Orientational variable-length strip covering problem: a branch-and-price-based algorithm
type: Item
instance of: scholarly article
title: Orientational variable-length strip covering problem: a branch-and-price-based algorithm
zbMATH Open document ID: 1487.90555
author: Waiming Zhu
author: Bo An
author: Yanling Zhi
author: Yi Wu
author: Xiao-xuan Hu
author: Hua-Wei Ma
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7354052
zbMATH Keywords: covering problem
zbMATH Keywords: strip covering problem
zbMATH Keywords: EOS scheduling
zbMATH Keywords: dominance rule
zbMATH Keywords: nested grids
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.003
OpenAlex ID: W3042032944
cites work: Approximation algorithms for hard capacitated \(k\)-facility location problems
cites work: Covering squares with squares
cites work: Disk packing in a square: a new global optimization approach
cites work: Solving Nonlinear Covering Problems Arising in WLAN Design
cites work: A heuristic approach for packing identical rectangles in convex regions
cites work: Optimal circle covering problems and their applications
cites work: Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
cites work: A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
cites work: A beam search approach to solve the convex irregular bin packing problem with guillotine guts
cites work: The Probabilistic Set-Covering Problem
cites work: The generalized maximal covering location problem
cites work: The gradual covering decay location problem on a network.
cites work: Robust mixed-integer linear programming models for the irregular strip packing problem
cites work: Beyond Triangulation: Covering Polygons with Triangles
cites work: An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
cites work: Determining optimal police patrol areas with maximal covering and backup covering location models
cites work: A Primer in Column Generation
cites work: On packing squares with equal squares
cites work: A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
cites work: Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
cites work: Compact packings of the plane with two sizes of discs
cites work: A constructive proof of swap local search worst-case instances for the maximum coverage problem
cites work: Covering Rectilinear Polygons with Axis-Parallel Rectangles
cites work: Branch-and-Bound Methods: A Survey
cites work: Matheuristics for the irregular bin packing problem with free rotations
cites work: Intelligent-guided adaptive search for the maximum covering location problem
cites work: The capacitated maximal covering location problem with backup service
cites work: Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
cites work: The Maximum Availability Location Problem
cites work: A clique covering MIP model for the irregular strip packing problem
cites work: Raster penetration map applied to the irregular packing problem
cites work: Covering a square of side \(n+\varepsilon\) with unit squares
cites work: A method of optimal lattice packing of congruent oriented polygons in the plane
cites work: A tolerance function for the multiobjective set covering problem
cites work: An algorithm for approximating the Pareto set of the multiobjective set covering problem
cites work: The connected disk covering problem
cites work: Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
cites work: A Kind of Triangle Covering and Packing Problem
DOI: 10.1016/J.EJOR.2020.07.003
Recommended article: A branch-and-price algorithm for solving the cutting strips problem
Recommended article: A branch-and-price algorithm for the two-dimensional level strip packing problem
Recommended article: A branch and bound algorithm for the strip packing problem
Recommended article: Branch-and-cut algorithms for the covering salesman problem
Recommended article: The variable-width strip packing problem
Recommended article: A branch-and-price-and-cut algorithm for the pattern minimization problem
Recommended article: Generalized Class Cover Problem with Axis-Parallel Strips
Recommended article: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
description: scientific article; zbMATH DE number 7354052