Orientational variable-length strip covering problem: a branch-and-price-based algorithm
From MaRDI portal
Publication:2028818
Recommendations
- A branch-and-price algorithm for solving the cutting strips problem
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- A branch and bound algorithm for the strip packing problem
- Branch-and-cut algorithms for the covering salesman problem
- The variable-width strip packing problem
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- Generalized class cover problem with axis-parallel strips
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Cites work
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
- A clique covering MIP model for the irregular strip packing problem
- A constructive proof of swap local search worst-case instances for the maximum coverage problem
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- A heuristic approach for packing identical rectangles in convex regions
- A kind of triangle covering and packing problem
- A method of optimal lattice packing of congruent oriented polygons in the plane
- A Primer in Column Generation
- A tolerance function for the multiobjective set covering problem
- An algorithm for approximating the Pareto set of the multiobjective set covering problem
- An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Beyond triangulation: covering polygons with triangles
- Branch-and-Bound Methods: A Survey
- Compact packings of the plane with two sizes of discs
- Covering a square of side \(n+\varepsilon\) with unit squares
- Covering Rectilinear Polygons with Axis-Parallel Rectangles
- Covering squares with squares
- Determining optimal police patrol areas with maximal covering and backup covering location models
- Disk packing in a square: a new global optimization approach
- Intelligent-guided adaptive search for the maximum covering location problem
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Matheuristics for the irregular bin packing problem with free rotations
- On packing squares with equal squares
- Optimal circle covering problems and their applications
- Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
- Raster penetration map applied to the irregular packing problem
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Solving nonlinear covering problems arising in WLAN design
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- The capacitated maximal covering location problem with backup service
- The connected disk covering problem
- The generalized maximal covering location problem
- The gradual covering decay location problem on a network.
- The Maximum Availability Location Problem
- The Probabilistic Set-Covering Problem
This page was built for publication: Orientational variable-length strip covering problem: a branch-and-price-based algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028818)
