{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:55Z","timestamp":1759667335810},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0166-218x(00)00314-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:57Z","timestamp":1027616877000},"page":"147-178","source":"Crossref","is-referenced-by-count":11,"title":["Facets of the p-cycle polytope"],"prefix":"10.1016","volume":"112","author":[{"given":"Mark","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zg\u00fcr","family":"\u00d6zl\u00fck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00314-0_BIB1","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(00)00314-0_BIB2","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","article-title":"The prize collecting traveling salesman problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00314-0_BIB3","unstructured":"E. Balas, On the cycle polytope of a directed graph, Management Science Research Report #MSSR-593, GSIA, Carnegie Mellon University, 1993."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","article-title":"A lifting procedure for the asymmetric traveling salesman problem polytope and a large new class of facets","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00314-0_BIB5","unstructured":"E. Balas, M. Oosten, On the cycle polytope of a directed graph, preprint, 1996."},{"issue":"1","key":"10.1016\/S0166-218X(00)00314-0_BIB6","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1287\/moor.22.1.110","article-title":"The circuit polytope: facets","volume":"22","author":"Bauer","year":"1997","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB7","unstructured":"P. Bauer, J.T. Linderoth, M.W.P. Savelsbergh, A branch and cut approach to the cardinality constrained circuit problem, Technical Report LEC-98-04, School of Industrial and Systems Engineering, Georgia Institute of Technology, 1998."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(94)90202-X","article-title":"Balancing problems in acyclic networks","volume":"49","author":"Boros","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB9","unstructured":"T. Christof, Ein Verfahren zur Transformation zwischen Polyederdarstellungen, Diplomarbeit, Universit\u00e4t Augsburg, 1991."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB10","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/0024-3795(89)90483-7","article-title":"On cycle cones and polyhedra","volume":"114\/115","author":"Coullard","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","article-title":"The median tour and maximal covering tour problems: formulations and heuristics","volume":"73","author":"Current","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB12","doi-asserted-by":"crossref","unstructured":"G.B. Dantzig, W.O. Blattner, M.R. Rao, Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem, in: Theory of Graphs (International Symposium, ed. P. Rosenstiel, Rome, 1966), Gordon and Breach, New York, 1967, pp. 77\u201383.","DOI":"10.21236\/AD0646553"},{"key":"10.1016\/S0166-218X(00)00314-0_BIB13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0166-218X(93)E0082-A","article-title":"Clique tree inequalities define facets of the asymmetric traveling salesman polytope","volume":"56","author":"Fischetti","year":"1995","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/S0166-218X(00)00314-0_BIB14","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","article-title":"A branch-and-cut algorithm for the symmetric generalized traveling salesman problem","volume":"45","author":"Fischetti","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB15","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","first-page":"251","article-title":"Polyhedral theory","author":"Gr\u00f6tschel","year":"1985"},{"key":"10.1016\/S0166-218X(00)00314-0_BIB16","doi-asserted-by":"crossref","unstructured":"M. Hartmann, \u00d6. \u00d6zl\u00fck, Solving the traveling circus problem by branch and cut, extended abstract, in: H.J. Broersma, U. Faigle, C. Hoede, J.L. Hurink (Eds.), Sixth Twente Workshop on Graphs and Combinatorial Optimization, Electronic Notes in Discrete Mathematics, Vol. 3, Elsevier, Amsterdam, 1999.","DOI":"10.1016\/S1571-0653(05)80027-7"},{"key":"10.1016\/S0166-218X(00)00314-0_BIB17","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","article-title":"Parametric shortest path algorithms with an application to cyclic staffing","volume":"3","author":"Karp","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB18","unstructured":"M. Kovalev, J.F. Maurras, Y. Vaxes, On the convex hull of the 3-cycles of the complete graph, Technical Report 251, Laboratoire d'Informatique de Marseille, Facult\u00e9 des Sciences de Luminy, 1997."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB19","unstructured":"J. Maurras, V.H. Nguyen, On the linear description of the 3-cycle polytope, preprint, 1998."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB20","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(00)00314-0_BIB21","unstructured":"V.H. Nguyen, J. Maurras, On the linear description of the k-cycle polytope, PCnk, preprint, 1999."},{"key":"10.1016\/S0166-218X(00)00314-0_BIB22","unstructured":"\u00d6. \u00d6zl\u00fck, The p-cycle polytope, Ph.D. Thesis, Department of Operations Research, UNC Chapel Hill, June 1999."},{"issue":"6","key":"10.1016\/S0166-218X(00)00314-0_BIB23","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/opre.44.6.864","article-title":"The plant location problem: new models and research prospects","volume":"44","author":"Revelle","year":"1996","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T13:26:54Z","timestamp":1579267614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0166218X00003140"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00314-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}