{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:10:32Z","timestamp":1683825032252},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1007\/bf02614506","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T04:45:46Z","timestamp":1177735546000},"page":"59-84","source":"Crossref","is-referenced-by-count":4,"title":["On the monotonization of polyhedra"],"prefix":"10.1007","volume":"78","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02614506_CR1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0402038","volume":"2","author":"E. Balas","year":"1989","unstructured":"E. Balas, The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph,SIAM Journal on Discrete Mathematics 2 (1989) 425\u2013451.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02614506_CR2","unstructured":"E. Balas, Finding out whether a valid inequality is facet defining, in: R. Kannan and W.R. Pulleyblank, eds.,Integer Programming and Combinatorial Optimization (University of Waterloo Press, 1990) 45\u201361."},{"key":"BF02614506_CR3","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1287\/moor.17.4.1001","volume":"17","author":"E. Balas","year":"1992","unstructured":"E. Balas and M. Fischetti, The fixed-outdegree 1-arborescence polytope,Mathematics of Operations Research 17 (1992) 1001\u20131018.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614506_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas and M. Fischetti, A lifting procedure for the asymmetric traveling salesman polytope and a large class of new facets,Mathematical Programming 58 (1993) 325\u2013352.","journal-title":"Mathematical Programming"},{"key":"BF02614506_CR5","unstructured":"S.C. Boyd and W.R. Pulleyblank, Facet generating techniques, Department of Combinatorics and Optimization, University of Waterloo, 1991."},{"key":"BF02614506_CR6","unstructured":"S. Chopra and G. Rinaldi, The graphical asymmetric traveling salesman polyhedron, in: R. Kannan and W.R. Pulleyblank, eds.,Integer Programming and Combinatorial Optimization (University of Waterloo Press, 1990)."},{"key":"BF02614506_CR7","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF02592027","volume":"36","author":"W. Cunningham","year":"1986","unstructured":"W. Cunningham and J. Green-Krotki, Dominants and submissives of matching polyhedra,Mathematical Programming 36 (1986) 228\u2013237.","journal-title":"Mathematical Programming"},{"key":"BF02614506_CR8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/moor.16.1.42","volume":"16","author":"M. Fischetti","year":"1991","unstructured":"M. Fischetti, Facets of the asymmetric traveling salesman polytope,Mathematics of Operations Research 16 (1991) 42\u201356.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614506_CR9","unstructured":"M. Fischetti, Three facet lifting theorems for the asymmetric traveling salesman polytope, in: E. Balas, G. Cornuejols and R. Kannan, eds.,Integer Programming and Combinatorial Optimization (Proceedings of IPCO 2), GSIA, Carnegie Mellon University (1992) 260\u2013273."},{"key":"BF02614506_CR10","unstructured":"M. Gr\u00f6tschel,Polyedrische Charakterisierungen Kombinatorischer Optimierungsprobleme (Hain, Maisenheim am Glen, 1977)."},{"key":"BF02614506_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, On the acyclic subgraph polytope,Mathematical Programming 33 (1985) 28\u201342.","journal-title":"Mathematical Programming"},{"key":"BF02614506_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, Facets of the linear ordering polytope,Mathematical Programming 33 (1985) 43\u201360.","journal-title":"Mathematical Programming"},{"key":"BF02614506_CR13","first-page":"251","volume-title":"The Traveling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M. Padberg, Polyhedral theory, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D. Shmoys, eds.,The Traveling Salesman Problem (Wiley, New York, 1985) 251\u2013305."},{"key":"BF02614506_CR14","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"M. Gr\u00f6tschel and W.R. Pulleyblank, Clique tree inequalities and the symmetric traveling salesman problem,Mathematics of Operations Research 11 (1986) 537\u2013569.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614506_CR15","volume-title":"Composition de polytopes combinatoires: Une approche par projection","author":"F. Margot","year":"1994","unstructured":"F. Margot, Composition de polytopes combinatoires: Une approche par projection, Th\u00e8se de doctorat No. 1209, EPF Lausanne, Switzerland, 1994."},{"key":"BF02614506_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1993","unstructured":"D. Naddef and G. Rinaldi, The graphical relaxation: A new framework for the symmetric traveling salesman polytope,Mathematical Programming 58 (1993) 53\u201387.","journal-title":"Mathematical Programming"},{"key":"BF02614506_CR17","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. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"BF02614506_CR18","series-title":"Working Paper","volume-title":"Hamilton path and symmetric travelling salesman polytopes","author":"M. Queyranne","year":"1989","unstructured":"M. Queyranne and Y. Wang, Hamilton path and symmetric travelling salesman polytopes, Working Paper 89-MSc-009, University of British Columbia, Vancouver, 1989."},{"key":"BF02614506_CR19","doi-asserted-by":"crossref","unstructured":"M. Queyranne and Y. Wang, Symmetric inequalities and their composition for asymmetric travelling salesman polytopes, 1994; Submitted toMathematical Programming.","DOI":"10.1287\/moor.20.4.838"},{"key":"BF02614506_CR20","volume-title":"Integer Programming and Combinatorial Optimization (Proceedings of IPCO 3)","author":"G. Rinaldi","year":"1993","unstructured":"G. Rinaldi and L.A. Wolsey,Integer Programming and Combinatorial Optimization (Proceedings of IPCO 3), CORE, Louvain-la-Neuve, Belgium, 1993."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614506.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614506\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T16:43:31Z","timestamp":1683823411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["BF02614506"],"URL":"https:\/\/doi.org\/10.1007\/bf02614506","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}