{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:21Z","timestamp":1740144501073,"version":"3.37.3"},"reference-count":17,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:00:00Z","timestamp":1564963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,9,21]]},"published-print":{"date-parts":[[2019,10]]},"abstract":"<jats:p>A <jats:italic>caterpillar<\/jats:italic> is a connected graph such that the removal of all its vertices with degree 1 results in a path. Given a graph <jats:italic>G<\/jats:italic>, a <jats:italic>caterpillar-packing of G<\/jats:italic> is a set of vertex-disjoint (not necessarily induced) subgraphs of <jats:italic>G<\/jats:italic> 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 <jats:italic>2-schemes strip cutting problem with a sequencing constraint<\/jats:italic> (2-SSCPsc) presented by Rinaldi and Franz (<jats:italic>Eur. J. Oper. Res.<\/jats:italic> <jats:bold>183<\/jats:bold> (2007) 1371\u20131384). 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.<\/jats:p>","DOI":"10.1051\/ro\/2018085","type":"journal-article","created":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T18:51:23Z","timestamp":1538592683000},"page":"1267-1277","source":"Crossref","is-referenced-by-count":0,"title":["Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope"],"prefix":"10.1051","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2694-4758","authenticated-orcid":false,"given":"Javier","family":"Marenco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,8,5]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"Baldacci","year":"2007","journal-title":"Oper. Res."},{"key":"R2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2013.05.013","volume":"231","author":"Calvete","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"R3","unstructured":"Dias T., de Sousa G., Macambira E., Cabral L. and Fampa M., An efficient heuristic for the ring star problem. In: Proceedings of the 5th International Workshop on Experimental Algorithms WEA 2006, Menorca, Spain. In Vol. 4007 of Lect. Note Comput. Sci. (2006) 24\u201335."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Dinneen M. and Khosravani M., A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs. In: Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity, Sirince. In Vol. 6058 of Lect. Notes Comput. Sci. 237\u2013246 (2010).","DOI":"10.1007\/978-3-642-13284-1_19"},{"key":"R5","unstructured":"Dinneen M. and Khosravani M., Hardness of approximation and integer programming frameworks for searching for caterpillar trees. In: Proceedings of the Seventeenth Computing on The Australasian Theory Symposium, Perth, Australia (2011) 145\u2013150."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L. and Schrijver A., Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin (1993).","DOI":"10.1007\/978-3-642-78240-4"},{"key":"R7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/02331930903500332","volume":"59","author":"Kedad-Sidhoum","year":"2010","journal-title":"Optimization"},{"key":"R8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"Labb\u00e9","year":"2004","journal-title":"Networks"},{"key":"R9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"R10","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s11081-014-9264-8","volume":"16","author":"Lucero","year":"2015","journal-title":"Optim. Eng."},{"key":"R11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.dam.2017.03.018","volume":"245","author":"Marenco","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"R12","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.ejor.2010.06.030","volume":"207","author":"Naji-Azimi","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1016\/j.ejor.2005.12.050","volume":"183","author":"Rinaldi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R14","unstructured":"Simonetti L., Frota Y. and de Souza C.C., An exact method for the minimum caterpillar spanning problem. In: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Optimization, Paris, France (2009) 48\u201351."},{"key":"R15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.endm.2009.11.015","volume":"35","author":"Simonetti","year":"2009","journal-title":"Eletron. Notes Discrete Math."},{"key":"R16","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10898-016-0431-7","volume":"67","author":"Sundar","year":"2017","journal-title":"J. Global Optim."},{"key":"R17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10489-013-0460-6","volume":"40","author":"Zhang","year":"2014","journal-title":"Appl. Intell."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018085\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:34:02Z","timestamp":1584689642000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,5]]},"references-count":17,"journal-issue":{"issue":"4"},"alternative-id":["ro180014"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018085","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2019,8,5]]}}}