Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
From MaRDI portal
Publication:5244302
DOI10.1051/RO/2018085zbMATH Open1432.90086OpenAlexW2895339751WikidataQ129163636 ScholiaQ129163636MaRDI QIDQ5244302FDOQ5244302
Authors: Javier Marenco 
Publication date: 20 November 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2018085
Recommendations
Cites Work
- Geometric algorithms and combinatorial optimization.
- Representation of a finite graph by a set of intervals on the real line
- The Capacitated m-Ring-Star Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- A two-dimensional strip cutting problem with sequencing constraint
- An efficient evolutionary algorithm for the ring star problem
- An exact algorithm for solving the ring star problem
- An Efficient Heuristic for the Ring Star Problem
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
- An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint
- Upper and lower bounding procedures for the minimum caterpillar spanning problem
- The caterpillar-packing polytope
Cited In (2)
This page was built for publication: Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244302)
