{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T16:58:52Z","timestamp":1758473932768},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T00:00:00Z","timestamp":1229385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10107-008-0257-2","type":"journal-article","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T15:34:49Z","timestamp":1229355289000},"page":"371-394","source":"Crossref","is-referenced-by-count":10,"title":["On cardinality constrained cycle and path polytopes"],"prefix":"10.1007","volume":"123","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]},{"given":"R\u00fcdiger","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,16]]},"reference":[{"issue":"1","key":"257_CR1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2","volume":"36","author":"E. Balas","year":"2000","unstructured":"Balas E., Oosten M.: On the cycle polytope of a directed graph. Networks 36(1), 34\u201346 (2000)","journal-title":"Networks"},{"key":"257_CR2","unstructured":"Balas, E., Stephan, R.: On the cycle polytope of a directed graph and its relaxations. Networks (submitted)"},{"key":"257_CR3","volume-title":"A Polyhedral Approach to the Weighted Girth Problem","author":"P. Bauer","year":"1995","unstructured":"Bauer P.: A Polyhedral Approach to the Weighted Girth Problem. Shaker, Aachen (1995)"},{"key":"257_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s101070100209","volume":"91","author":"P. Bauer","year":"2002","unstructured":"Bauer P., Linderoth J.T., Savelsbergh M.W.P.: A branch and cut approach to the cardinality constrained circuit problem. Math. Program., Ser. A 91, 307\u2013348 (2002)","journal-title":"Math. Program., Ser. A"},{"issue":"1","key":"257_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/trsc.1060.0161","volume":"41","author":"R. Bornd\u00f6rfer","year":"2007","unstructured":"Bornd\u00f6rfer R., Gr\u00f6tschel M., Pfetsch M.E.: A column-generation approach to line planning in public transport. Transp. Sci. 41(1), 123\u2013132 (2007)","journal-title":"Transp. Sci."},{"key":"257_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(94)90202-X","volume":"49","author":"E. Boros","year":"1994","unstructured":"Boros E., Hammer P., Hartmann M., Shamir R.: Balancing problems in acyclic networks. Discrete Appl. Math. 49, 77\u201393 (1994)","journal-title":"Discrete Appl. Math."},{"key":"257_CR7","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/0024-3795(89)90483-7","volume":"114\/115","author":"C. Coullard","year":"1989","unstructured":"Coullard C., Pulleyblank W.R.: On cycle cones and polyhedra. Linear Algebra Appl. 114\/115, 613\u2013640 (1989)","journal-title":"Linear Algebra Appl."},{"key":"257_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-6377(03)00026-9","volume":"32","author":"G. Dahl","year":"2004","unstructured":"Dahl G., Gouveia L.: On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32, 15\u201322 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"257_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B","volume":"36","author":"G. Dahl","year":"2000","unstructured":"Dahl G., Realfsen B.: The cardinality-constrained shortest path problem in 2-graphs. Networks 36(1), 1\u20138 (2000)","journal-title":"Networks"},{"key":"257_CR10","volume-title":"On the densest k-subgraph problem. Technical report, Department of Applied Mathematics and Computer Science","author":"U. Feige","year":"1997","unstructured":"Feige U., Seltser M.: On the densest k-subgraph problem. Technical report, Department of Applied Mathematics and Computer Science. The Weizmann Institute, Rehobot (1997)"},{"key":"257_CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0166-218X(93)E0082-A","volume":"56","author":"M. Fischetti","year":"1995","unstructured":"Fischetti M.: Clique tree inequalites define facets of the asymmetric traveling salesman polytope. Discrete Appl. Math. 56, 9\u201318 (1995)","journal-title":"Discrete Appl. Math."},{"key":"257_CR12","unstructured":"Gawrilow, E., Joswig, M.: Polymake: a framework for analyzing convex polytopes. In: Kalai, G., Ziegler, G.M. (eds.), Polytopes Combinatorics and Computation (DMV-Seminars, pp. 43 74), Birkh\u00e4user, Basel, 2000. See also http:\/\/www.math.tu-berlin.de\/polymake"},{"key":"257_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M.: Cardinality homogeneous set systems, cycles in matroids, and associated polytopes. In: Gr\u00f6tschel, M. (ed.) The sharpest cut. The impact of Manfred Padberg and his work. MPS\/SIAM Ser. Optim., vol. 4, pp. 199\u2013216 (2004)","DOI":"10.1137\/1.9780898718805.ch8"},{"key":"257_CR14","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: Polyhedral theory. In: Lawler, E.L., et al. (ed.), The traveling salesman problem. A guided tour of combinatorial optimization. Chichester, pp. 251\u2013305 (1985)"},{"key":"257_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0166-218X(00)00314-0","volume":"112","author":"M. Hartmann","year":"2001","unstructured":"Hartmann M., \u00d6zl\u00fck \u00d6.: Facets of the p-cycle polytope. Discrete Appl. Math. 112, 147\u2013178 (2001)","journal-title":"Discrete Appl. Math."},{"key":"257_CR16","unstructured":"Kaibel, V., Stephan, R.: On cardinality constrained cycle and path polytopes. ZIB-Report 07-25, Berlin, 2007. Available at www.zib.de\/bib\/pub\/index.en.html"},{"key":"257_CR17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1590\/S0101-74382003000100008","volume":"23","author":"M. Kovalev","year":"2003","unstructured":"Kovalev M., Maurras J.-F., Vax\u00e9s Y.: On the convex hull of 3-cycles of the complete graph. Pesquisa Oper. 23, 99\u2013109 (2003)","journal-title":"Pesquisa Oper."},{"issue":"2","key":"257_CR18","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/S0377-2217(01)00212-0","volume":"137","author":"J.-F. Maurras","year":"2002","unstructured":"Maurras J.-F., Nguyen V.H.: On the linear description of the 3-cycle polytope. Eur. J. Oper. Res. 137(2), 310\u2013325 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"257_CR19","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1111\/1475-3995.t01-1-00331","volume":"8","author":"J.-F. Maurras","year":"2001","unstructured":"Maurras J.-F., Nguyen V.H.: On the linear description of the k-cycle polytope, $${PC_n^k}$$ . Int. Trans. Oper. Res. 8, 673\u2013692 (2001)","journal-title":"Int. Trans. Oper. Res."},{"key":"257_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"257_CR21","unstructured":"Nguyen, V.H.: A complete description for the k-path polyhedron. In: Proceedings of the Fifth International Conference on Modelling, Computation and Optimization in Information Systems and Management Science, Hermes Science Publishing, pp. 249\u2013255 (2004)"},{"key":"257_CR22","unstructured":"Stephan, R.: Facets of the (s,t)-p-path polytope. arXiv: math.OC\/0606308 (2006)"},{"key":"257_CR23","volume-title":"Combinatorial Optimization, vol. A","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization, vol. A. Springer, Berlin (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0257-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0257-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0257-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:06Z","timestamp":1559123406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0257-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,16]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0257-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,16]]}}}