{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:30:12Z","timestamp":1649183412137},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540594086","type":"print"},{"value":"9783540492450","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:16:23Z","timestamp":1330276583000},"page":"50-64","source":"Crossref","is-referenced-by-count":7,"title":["The interval order polytope of a digraph"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"M\u00fcller","sequence":"first","affiliation":[]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"4","key":"5_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(4):425\u2013451, 1989.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5_CR2","volume-title":"Technical Report","author":"A. Caprara","year":"1993","unstructured":"A. Caprara and M. Fischetti. Odd cut-sets, odd cycles and 0\u20131\/2 Chv\u00e1tal-Gomory cuts. Technical Report, DEIS, University of Bologna, Bologna, Italy, 1993, revised 1995."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"13","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal. On certain polytopes associated with graphs. Journal of Combinatorial Theory Ser. B, 13:138\u2013154, 1975.","journal-title":"Journal of Combinatorial Theory Ser. B"},{"key":"5_CR4","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. The partition problem. Mathematical Programming, 59:87\u2013115, 1993.","journal-title":"Mathematical Programming"},{"key":"5_CR5","volume-title":"Interval Orders and Interval Graphs: A Study of Partially Ordered Sets","author":"P. C. Fishburn","year":"1985","unstructured":"P. C. Fishburn. Interval Orders and Interval Graphs: A Study of Partially Ordered Sets. John Wiley & Sons, New York, 1985."},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0022-2496(90)90019-6","volume":"34","author":"I. Gilboa","year":"1990","unstructured":"I. Gilboa. A necessary but insufficient condition for the stochastic binary choice problem. Journal of Mathematical Psychology, 34:371\u2013392, 1990.","journal-title":"Journal of Mathematical Psychology"},{"key":"5_CR7","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, 1979."},{"key":"5_CR8","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:43\u201360, 1985.","journal-title":"Mathematical Programming"},{"key":"5_CR9","volume-title":"Technical Report 270\/92","author":"M. C. Golumbic","year":"1992","unstructured":"M. C. Golumbic, H. Kaplan, and R. Shamir. Graph sandwich problems. Technical Report 270\/92, Computer Science Dept., Tel Aviv University, Israel, 1992."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/aama.1994.1009","volume":"15","author":"M. C. Golumbic","year":"1994","unstructured":"M. C. Golumbic, H. Kaplan, and R. Shamir. On the complexity of DNA physical mapping. Advances in Applied Mathematics, 15:251\u2013261, 1994.","journal-title":"Advances in Applied Mathematics"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1145\/174147.169675","volume":"40","author":"M. C. Golumbic","year":"1993","unstructured":"M. C. Golumbic and R. Shamir. Complexity and algorithms for reasoning about time: A graph-theoretic approach. Journal of the Association for Computing Machinery, 40:1108\u20131133, 1993.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"5_CR12","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. Facets of the clique partitioning polytope. Mathematical Programming, 47(3):367\u2013388, 1990.","journal-title":"Mathematical Programming"},{"key":"5_CR13","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. More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Applied Mathematics, 50:185\u2013200, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"R. H. M\u00f6hring. Graph problems related to gate matrix layout and PLA folding. In G. Tinhofer, E. Mayr, H. Noltemeier, and M. Syslo, editors, Computational Graph Theory, pages 17\u201352. Springer, 1990.","DOI":"10.1007\/978-3-7091-9076-0_2"},{"key":"5_CR15","unstructured":"R. H. M\u00f6hring, 1994. Personal communication."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"R. H. M\u00f6hring and F. J. Radermacher. The order theoretic approach to scheduling: The deterministic case. In R. Slowinski and J. Weglarz, editors, Advances in Project Scheduling, pages 26\u201366. Elseviers Science Publication, 1989.","DOI":"10.1016\/B978-0-444-87358-3.50006-7"},{"key":"5_CR17","series-title":"Fachbereich Mathematik","volume-title":"PhD thesis","author":"R. M\u00fcller","year":"1993","unstructured":"R. M\u00fcller. Bounds for linear VLSI problems. PhD thesis, Fachbereich Mathematik, Technische Universit\u00e4t Berlin, Berlin, Germany, 1993."},{"key":"5_CR18","unstructured":"R. M\u00fcller. On the transitive acyclic subdigraph polytope. In G. Rinaldi and L. Wolsey, editors, Proceedings of the Third Conference on Integer Programming and Combinatorial Optimization, pages 463\u2013477, 1993."},{"key":"5_CR19","volume-title":"Integer and Combinatorial Optimization","author":"G. L. Nemhauser","year":"1988","unstructured":"G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988."}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:27:01Z","timestamp":1605648421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-59408-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1995]]}}}