{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:41:49Z","timestamp":1648755709932},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T00:00:00Z","timestamp":1207094400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s10878-008-9151-3","type":"journal-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T15:42:38Z","timestamp":1207064558000},"page":"328-343","source":"Crossref","is-referenced-by-count":0,"title":["Computing monotone disjoint paths on polytopes"],"prefix":"10.1007","volume":"16","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]},{"given":"Bohdan","family":"Kaluzny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,2]]},"reference":[{"key":"9151_CR1","first-page":"1259","volume":"3","author":"GM Adel\u2019son-Vel\u2019skii","year":"1962","unstructured":"Adel\u2019son-Vel\u2019skii GM, Landis EM (1962) An algorithm for the organization of information. Sov Math Dokl 3:1259\u20131262","journal-title":"Sov Math Dokl"},{"key":"9151_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1090\/conm\/223\/03132","volume":"223","author":"N Amenta","year":"1999","unstructured":"Amenta N, Ziegler G (1999) Deformed products and maximal shadows of polytopes. Contemp Math 223:57\u201390","journal-title":"Contemp Math"},{"key":"9151_CR3","series-title":"DMV seminar band","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-0348-8438-9_9","volume-title":"Polytopes\u2014combinatorics and computation","author":"D Avis","year":"2000","unstructured":"Avis D (2000) lrs: a revised implementation of the reverse search vertex enumeration problem. In: Kalai G, Ziegler G (eds) Polytopes\u2014combinatorics and computation. DMV seminar band, vol 29. Birkhauser, Basel, pp 177\u2013198"},{"key":"9151_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"6","author":"D Avis","year":"1996","unstructured":"Avis D, Fukuda K (1996) Reverse search for enumeration. Discrete Appl Math 6:21\u201346","journal-title":"Discrete Appl Math"},{"key":"9151_CR5","unstructured":"Avis D, Kaluzny B (March 2005) Computing disjoint paths on polytopes. Les cahiers du GERAD G-2005-26, 23\u00a0p"},{"key":"9151_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0925-7721(96)00023-5","volume":"7","author":"D Avis","year":"1997","unstructured":"Avis D, Bremner D, Seidel R (1997) How good are convex hull algorithms. Comput Geom Theory Appl 7:265\u2013301","journal-title":"Comput Geom Theory Appl"},{"key":"9151_CR7","volume-title":"Linear programming","author":"V Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal V (1980) Linear programming. Freeman, New York"},{"key":"9151_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0167-6377(99)00026-7","volume":"25","author":"C Filippi","year":"1999","unstructured":"Filippi C (1999) A reverse search algorithm for the neighborhood problem. Oper Res Lett 25:33\u201337","journal-title":"Oper Res Lett"},{"key":"9151_CR9","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L Ford","year":"1956","unstructured":"Ford L, Fulkerson D (1956) Maximal flow through a network. Canad J Math 8:1142\u20131146","journal-title":"Canad J Math"},{"issue":"4","key":"9151_CR10","first-page":"431","volume":"10","author":"K Fukuda","year":"1999","unstructured":"Fukuda K, Terlaky T (1999) On the existence of a short admissible pivot sequence for feasibility and linear optimization problems. PUMA: Math Optim 10(4):431\u2013447","journal-title":"PUMA: Math Optim"},{"key":"9151_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1090\/conm\/223\/03138","volume":"223","author":"F Holt","year":"1999","unstructured":"Holt F, Klee V (1999) A proof of the strict monotone 4-step conjecture. Contemp Math 223:201\u2013216","journal-title":"Contemp Math"},{"key":"9151_CR12","first-page":"159","volume-title":"Inequalities\u2013III","author":"V Klee","year":"1972","unstructured":"Klee V, Minty GJ (1972) How good is the simplex algorithm? In: Shisha O (ed) Inequalities\u2013III. Academic, New York, pp\u00a0159\u2013175"},{"key":"9151_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen P (1970) The maximum number of faces of a convex polytope. Mathematika 17:179\u2013184","journal-title":"Mathematika"},{"key":"9151_CR14","volume-title":"Linear programming","author":"K Murty","year":"1983","unstructured":"Murty K (1983) Linear programming. Wiley, New York"},{"key":"9151_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10586458.2004.10504519","volume":"13-1","author":"J Pfeifle","year":"2004","unstructured":"Pfeifle J, Ziegler G (2004) On the monotone upper bound problem. Exp Math 13-1:1\u201312","journal-title":"Exp Math"},{"key":"9151_CR16","volume-title":"Combinatorial optimization\u2014polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization\u2014polyhedra and efficiency. Springer, Berlin"},{"key":"9151_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46","author":"T Terlaky","year":"1993","unstructured":"Terlaky T, Zhang S (1993) Pivot rules for linear programming: a\u00a0survey on recent theoretical developments. Ann Oper Res 46:203\u2013233","journal-title":"Ann Oper Res"},{"key":"9151_CR18","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1287\/moor.5.4.599","volume":"5","author":"M Todd","year":"1980","unstructured":"Todd M (1980) The monotone bounded Hirsch conjecture is false for dimension at least four. Math Oper Res 5:599\u2013601","journal-title":"Math Oper Res"},{"key":"9151_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on polytopes","author":"G Ziegler","year":"1995","unstructured":"Ziegler G (1995) Lectures on polytopes. Springer, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9151-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9151-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9151-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9151-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,2]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9151"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9151-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,2]]}}}