Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
Autor: | Javier Marenco |
---|---|
Rok vydání: | 2019 |
Předmět: |
021103 operations research
0211 other engineering and technologies Polytope 02 engineering and technology Management Science and Operations Research Graph Computer Science Applications Theoretical Computer Science Combinatorics 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Connectivity MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
Zdroj: | RAIRO - Operations Research. 53:1267-1277 |
ISSN: | 1290-3868 0399-0559 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |