{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T10:39:02Z","timestamp":1706179142829},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1007\/bf01592241","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:01:22Z","timestamp":1114718482000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Ideal polytopes and face structures of some combinatorial optimization problems"],"prefix":"10.1007","volume":"71","author":[{"given":"Yoshiko T.","family":"Ikebe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihisa","family":"Tamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"E. Balas and W. Niehaus, \u201cFinding large cliques by bipartite matching,\u201d Management Science Research Report #MSSR-597, Carnegie Mellon University (1994)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M. Padberg, \u201cSet partitioning: A survey,\u201dSIAM Review 18 (1976) 710\u2013760.","journal-title":"SIAM Review"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/1016083","volume":"16","author":"M.L. Balinski","year":"1974","unstructured":"M.L. Balinski and A. Russakoff, \u201cOn the assignment polytope,\u201dSIAM Review 16 (1974) 516\u2013525.","journal-title":"SIAM Review"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, \u201cOn certain polytopes associated with graphs,\u201dJournal of Combinatorial Theory. Series B 18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"CR5","unstructured":"J. Etcheberry, \u201cAdjacent vertices in the convex hull of solutions to the set representation problem,\u201d Departamento de Industrias, Pub. 74\/23\/C, Universidad de Chile (1974)."},{"key":"CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979)."},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M. Gr\u00f6tschel","year":"1991","unstructured":"M. Gr\u00f6tschel and O. Holland, \u201cSolution of large-scale symmetric travelling salesman problems,\u201dMathematical Programming 51 (2) (1991) 141\u2013202.","journal-title":"Mathematical Programming"},{"key":"CR8","volume-title":"Adjacency on Polytopes in Combinatorial Optimization","author":"D. Hausmann","year":"1979","unstructured":"D. Hausmann,Adjacency on Polytopes in Combinatorial Optimization (Oelschlager, Gunn & Hain, Cambridge, MA, 1979)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BFb0121197","volume":"8","author":"D. Hausmann","year":"1978","unstructured":"D. Hausmann and B. Korte, \u201cColouring criteria for adjacency on 0\u20131-polyhedra,\u201dMathematical Programming Study 8 (1978) 106\u2013127.","journal-title":"Mathematical Programming Study"},{"key":"CR10","unstructured":"T. Matsui and S. Tamura, Private communication (1993)."},{"issue":"2\u20133","key":"CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0166-218X(94)00092-R","volume":"56","author":"T. Matsui","year":"1995","unstructured":"T. Matsui and S. Tamura, \u201cAdjacency on combinatorial polyhedra,\u201dDiscrete Applied Mathematics 56 (2\u20133) (1995) 311\u2013321.","journal-title":"Discrete Applied Mathematics"},{"key":"CR12","volume-title":"Optimization","year":"1989","unstructured":"G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, eds.,Optimization (North-Holland, Amsterdam, 1989)."},{"key":"CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01585502","volume":"7","author":"M.W. Padberg","year":"1974","unstructured":"M.W. Padberg and M.R. Rao, \u201cThe travelling salesman problem and a class of polyhedra of diameter two,\u201dMathematical Programming 7 (1) (1974) 32\u201345.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"M.W. Padberg and R. Rinaldi, \u201cA branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems,\u201dSIAM Review 33 (1991) 60\u2013100.","journal-title":"SIAM Review"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1287\/mnsc.22.11.1268","volume":"22","author":"J. Picard","year":"1976","unstructured":"J. Picard, \u201cMaximal closure of a graph and applications to combinatorial problems,\u201dManagement Science 22 (1976) 1268\u20131272.","journal-title":"Management Science"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0130021","volume":"30","author":"M.R. Rao","year":"1976","unstructured":"M.R. Rao, \u201cAdjacency of the traveling salesman tours and 0\u20131 vertices,\u201dSIAM Journal on Applied Mathematics 30 (1976) 191\u2013198.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR18","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01592241.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01592241\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01592241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T09:53:49Z","timestamp":1706176429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01592241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF01592241"],"URL":"https:\/\/doi.org\/10.1007\/bf01592241","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}