The caterpillar-packing polytope

DOI10.1016/j.endm.2015.07.009zbMath1347.05159OpenAlexW2211676751MaRDI QIDQ5890933

Javier Marenco

Publication date: 17 October 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.009

zbMATH Keywords

facetscaterpillar-packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The caterpillar-packing polytope

Cites Work

• 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 Ring Star Problem: Polyhedral analysis and exact algorithm

This page was built for publication: The caterpillar-packing polytope