Volume 53, Number 4, October-December 2019
|Page(s)||1267 - 1277|
|Published online||05 August 2019|
Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
Sciences Institute, National University of General Sarmiento, J. M. Gutiérrez 1150, Malvinas Argentinas, 1613 Provincia de Buenos Aires, Argentina
2 Computer Science Dept., FCEyN, University of Buenos Aires. Int. Güiraldes y Av. Cantilo, Pabellón I, Planta Baja, 1428 Buenos Aires, Argentina
Accepted: 21 September 2018
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results in a path. Given a graph G, a caterpillar-packing of G is a set of vertex-disjoint (not necessarily induced) subgraphs of G such that each subgraph is a caterpillar. In this work we consider the set of caterpillar-packings of a graph, which corresponds to feasible solutions of the 2-schemes strip cutting problem with a sequencing constraint (2-SSCPsc) presented by Rinaldi and Franz (Eur. J. Oper. Res. 183 (2007) 1371–1384). Facet-preserving procedures have been shown to be quite effective at explaining the facet-inducing inequalities of the associated polytope, so in this work we continue this issue by exploring such procedures for valid inequalities with acyclic supports. In particular, the obtained results are applicable when the underlying graph is a tree.
Mathematics Subject Classification: 90C10 / 90C27
Key words: Caterpillar-packing / facets / trees
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.