The caterpillar-packing polytope

DOI10.1016/j.dam.2017.03.018zbMath1387.05132OpenAlexW2606452770MaRDI QIDQ5916056

Javier Marenco

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.03.018

zbMATH Keywords

facetscaterpillar-packing

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

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

Cites Work

• Unnamed Item
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• A heuristic procedure for the capacitated \(m\)-ring-star problem
• An efficient evolutionary algorithm for the ring star problem
• An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint
• A two-dimensional strip cutting problem with sequencing constraint
• Upper and lower bounding procedures for the minimum caterpillar spanning problem
• Representation of a finite graph by a set of intervals on the real line
• The Capacitated m-Ring-Star Problem
• An exact algorithm for solving the ring star problem
• A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• An Efficient Heuristic for the Ring Star Problem
• The caterpillar-packing polytope