{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:19:16Z","timestamp":1758701956460},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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,4]]},"DOI":"10.1007\/bf02592097","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:55:46Z","timestamp":1175183746000},"page":"31-49","source":"Crossref","is-referenced-by-count":19,"title":["On the partial order polytope of a digraph"],"prefix":"10.1007","volume":"73","author":[{"given":"Rudolf","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592097_CR1","first-page":"127","volume-title":"Flexible Manufacturing Systems: Methods and Studies","author":"P. Afentakis","year":"1986","unstructured":"P. Afentakis, \u201cA model for layout design in FMS,\u201d in: A. Kusiak, ed.,Flexible Manufacturing Systems: Methods and Studies, (North-Holland, Amsterdam, 1986) pp 127\u2013139."},{"key":"BF02592097_CR2","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows (Prentice-Hall, Englewood Cliffs, NY, 1993)."},{"key":"BF02592097_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1985","unstructured":"F. Barahona and A.R. Mahjoub, \u201cOn the cut polytope,\u201dMathematical Programming 36 (1985) 157\u2013173.","journal-title":"Mathematical Programming"},{"key":"BF02592097_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (Macmillan, London, 1976)."},{"key":"BF02592097_CR5","unstructured":"A. Caprara and M. Fischetti, \u201cOdd cut-sets, odd cycles and 0\u22121\/2 Chv\u00e0tal-Gomory cuts,\u201d Technical Report, DEIS, University of Bologna (1993)."},{"key":"BF02592097_CR6","doi-asserted-by":"crossref","unstructured":"A. Caprara and M. Fischetti, \u201c{0\u22121\/2}-Chv\u00e0tal-Gomory cuts,\u201d Technical Report, DEIS, University of Bologna (1995).","DOI":"10.1007\/BF02592196"},{"key":"BF02592097_CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S. Chopra","year":"1993","unstructured":"S. Chopra and M.R. Rao, \u201cThe partition problem,\u201dMathematical Programming 59 (1993) 87\u2013115.","journal-title":"Mathematical Programming"},{"key":"BF02592097_CR8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal, \u201cEdmonds polytopes and a hierarchy of combinatorial problems\u201d,Discrete Mathematics 4 (1973) 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"BF02592097_CR9","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/moor.17.4.981","volume":"17","author":"M. Deza","year":"1992","unstructured":"M. Deza, M. Gr\u00f6tschel and M. Laurent, \u201cClique-web facets for multicut polytopes,\u201dMathematics of Operations Research 17 (1992) 981\u20131000.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592097_CR10","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0403041","volume":"3","author":"P.C. Fishburn","year":"1990","unstructured":"P.C. Fishburn, \u201cBinary probabilities induced by rankings,\u201dSIAM Journal on Discrete Mathematics 3 (1990) 478\u2013488.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02592097_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0165-4896(92)90038-7","volume":"23","author":"P.C. Fishburn","year":"1992","unstructured":"P.C. Fishburn, \u201cInduced binary probabilities and the linear ordering polytope: a status report,\u201dMathematical Social Sciences 23 (1992) 67\u201380.","journal-title":"Mathematical Social Sciences"},{"key":"BF02592097_CR12","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)."},{"key":"BF02592097_CR13","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, \u201cOn the acyclic subgraph polytope,\u201dMathematical Programming 33 (1985) 28\u201342.","journal-title":"Mathematical Programming"},{"key":"BF02592097_CR14","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, \u201cFacets of the linear ordering polytope\u201d,Mathematical Programming 33 (1985) 43\u201360.","journal-title":"Mathematical Programming"},{"key":"BF02592097_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"BF02592097_CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"M. Gr\u00f6tschel and Y. Wakabayashi, \u201cA cutting plane algorithm for a clustering problem,\u201dMathematical Programming 45 (1989) 59\u201396.","journal-title":"Mathematical Programming"},{"key":"BF02592097_CR17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and Y. Wakabayashi, \u201cFacets of the clique partitioning polytope,\u201dMathematical Programming 47 (1990) 367\u2013388.","journal-title":"Mathematical Programming"},{"key":"BF02592097_CR18","series-title":"Research and Expositions in Mathematics","volume-title":"Polyhedral Combinatorics and the Acyclic Subdigraph Problem","author":"M. J\u00fcnger","year":"1985","unstructured":"M. J\u00fcnger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem, Research and Expositions in Mathematics, Vol. 7, Heldermann, Berlin, 1985)."},{"key":"BF02592097_CR19","series-title":"Technical Report 90-13","volume-title":"Polyhedral structure and properties of a model for layout design","author":"J. Leung","year":"1990","unstructured":"J. Leung, \u201cPolyhedral structure and properties of a model for layout design,\u201d Technical Report 90-13, Department of Operations Research, Yale University, New Haven, CT (1990)."},{"key":"BF02592097_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(92)00151-B","volume":"50","author":"J. Leung","year":"1994","unstructured":"J. Leung and J. Lee, \u201cMore facets from fences for linear ordering and acyclic subgraph polytopes,\u201dDiscrete Applied Mathematics 50 (1994) 185\u2013200.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02592097_CR21","unstructured":"R. M\u00fcller, \u201cBounds for linear VLSI problems,\u201d Ph.D. thesis, Fachbereich Mathematik, Technische Universit\u00e4t Berlin (1993)."},{"key":"BF02592097_CR22","unstructured":"R. M\u00fcller, \u201cOn the transitive acyclic subdigraph polytope,\u201d in: G. Rinaldi and L. Wolsey, eds.,Integer Programming and Combinatorial Optimization, Proceedings of the Third IPCO Conference (1993) pp. 463\u2013477."},{"key":"BF02592097_CR23","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-59408-6_41","volume-title":"Integer Programming and Combinatorial Optimization, Proceedings of the Fourth IPCO Conference","author":"R. M\u00fcller","year":"1995","unstructured":"R. M\u00fcller and A.S. Schulz, \u201cThe interval order polytope of a digraph,\u201d in: E. Balas and J. Clausen, eds.,Integer Programming and Combinatorial Optimization, Proceedings of the Fourth IPCO Conference, (Springer, Berlin, 1995) pp. 50\u201364."},{"key":"BF02592097_CR24","series-title":"Research and Expositions in Mathematics","volume-title":"The Linear Ordering Problem: Algorithms and Applications","author":"G. Reinelt","year":"1985","unstructured":"G. Reinelt,The Linear Ordering Problem: Algorithms and Applications, Research and Expositions in Mathematics, Vol. 8, (Heldermann, Berlin, 1985)."},{"key":"BF02592097_CR25","unstructured":"G. Reinelt, \u201cA note on small linear ordering polytopes,\u201d Report 329, Universit\u00e4t Augsburg (1991)."},{"key":"BF02592097_CR26","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)."},{"key":"BF02592097_CR27","unstructured":"Y. Wakabayashi, private communication."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592097.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592097\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["BF02592097"],"URL":"https:\/\/doi.org\/10.1007\/bf02592097","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}