Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope

DOI10.1051/RO/2018085MaRDI QIDQ5244302zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

treesfacetscaterpillar-packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• The caterpillar-packing polytope
• The caterpillar-packing polytope
• On caterpillar factors in graphs
• Packing Steiner trees: Further facets
• Caterpillar arboricity of planar graphs

Cites work

• A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
• A heuristic procedure for the capacitated \(m\)-ring-star problem
• A two-dimensional strip cutting problem with sequencing constraint
• An Efficient Heuristic for the Ring Star Problem
• An efficient evolutionary algorithm for the ring star problem
• An exact algorithm for solving the ring star problem
• An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint
• Geometric algorithms and combinatorial optimization.
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• 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
• The caterpillar-packing polytope
• Upper and lower bounding procedures for the minimum caterpillar spanning problem

Cited in

(2)

• The caterpillar-packing polytope
• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope

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)