{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T12:35:55Z","timestamp":1777120555046,"version":"3.51.4"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.disopt.2026.100938","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T13:07:07Z","timestamp":1772629627000},"page":"100938","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The length polyhedron of an interval order"],"prefix":"10.1016","volume":"60","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8263-6787","authenticated-orcid":false,"given":"Csaba","family":"Bir\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9 E.","family":"K\u00e9zdy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jen\u0151","family":"Lehel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2026.100938_b1","series-title":"A Study of Partially Ordered Sets, a Wiley-Interscience Publication","article-title":"Interval orders and interval graphs","author":"Fishburn","year":"1985"},{"issue":"1\u20133","key":"10.1016\/j.disopt.2026.100938_b2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)90229-H","article-title":"Bounded discrete representations of interval orders","volume":"44","author":"Isaak","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2026.100938_b3","series-title":"The Mathematics of Preference, Choice and Order","first-page":"303","article-title":"Interval order representations via shortest paths","author":"Isaak","year":"2009"},{"issue":"195","key":"10.1016\/j.disopt.2026.100938_b4","first-page":"55","article-title":"The representation cone of an interval order","author":"Doignon","year":"2011","journal-title":"Math. Sci. Hum. Math. Soc. Sci."},{"key":"10.1016\/j.disopt.2026.100938_b5","series-title":"Representation and Enumeration of Interval Orders and Semiorders","author":"Greenough","year":"1976"},{"key":"10.1016\/j.disopt.2026.100938_b6","series-title":"The Schrijver system of the length polyhedron of an interval order","author":"K\u00e9zdy","year":"2024"},{"key":"10.1016\/j.disopt.2026.100938_b7","series-title":"Interval Orders with Restrictions on the Interval Lengths","author":"Boyadzhiyska","year":"2016"},{"key":"10.1016\/j.disopt.2026.100938_b8","series-title":"Structural Considerations for Interval Orders with Length Constraints","author":"Gordon","year":"2018"},{"key":"10.1016\/j.disopt.2026.100938_b9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.dam.2019.06.021","article-title":"Interval orders with two interval lengths","volume":"267","author":"Boyadzhiyska","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2026.100938_b10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.dam.2021.12.029","article-title":"On subclasses of interval count two and on fishburn\u2019s conjecture","volume":"323","author":"Francis","year":"2022","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"10.1016\/j.disopt.2026.100938_b11","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.ipl.2014.04.002","article-title":"Graphs of interval count two with a given partition","volume":"114","author":"Joos","year":"2014","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disopt.2026.100938_b12","series-title":"Two-count interval representation of a permutation","author":"Bir\u00f3","year":"2024"},{"key":"10.1016\/j.disopt.2026.100938_b13","doi-asserted-by":"crossref","DOI":"10.1007\/s00373-024-02863-9","article-title":"Dimension bounds on classes of interval orders with restricted representation","volume":"40","author":"Bir\u00f3","year":"2024","journal-title":"Graphs Combin."},{"issue":"3","key":"10.1016\/j.disopt.2026.100938_b14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-2496(69)90012-1","article-title":"Composite measurment","volume":"6","author":"Ducamp","year":"1969","journal-title":"J. Math. Psych."},{"issue":"1","key":"10.1016\/j.disopt.2026.100938_b15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0022-2496(84)90020-8","article-title":"On realizable biorders and the biorder dimension of a relation","volume":"28","author":"Doignon","year":"1984","journal-title":"J. Math. Psych."},{"key":"10.1016\/j.disopt.2026.100938_b16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0020-7373(85)80031-6","article-title":"Spaces for the assessment of knowledge","volume":"23","author":"Doignon","year":"1985","journal-title":"Int. J. Man-Mach. Stud."},{"issue":"3","key":"10.1016\/j.disopt.2026.100938_b17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(91)90057-4","article-title":"Synthetic description of a semiorder","volume":"31","author":"Pirlot","year":"1991","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.disopt.2026.100938_b18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","article-title":"Finding all the elementary circuits of a directed graph","author":"Johnson","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disopt.2026.100938_b19","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","article-title":"Intransitive indifference with unequal indifference intervals","volume":"7","author":"Fishburn","year":"1970","journal-title":"J. Math. Psych."},{"issue":"7","key":"10.1016\/j.disopt.2026.100938_b20","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1016\/j.jcta.2009.12.007","article-title":"(2+2)-Free posets, ascent sequences and pattern avoiding permutations","volume":"117","author":"Bousquet-M\u00e9lou","year":"2010","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.disopt.2026.100938_b21","series-title":"Johns Hopkins Series in the Mathematical Sciences","article-title":"Combinatorics and Partially Ordered Sets","author":"Trotter","year":"1992"},{"key":"10.1016\/j.disopt.2026.100938_b22","first-page":"1192","article-title":"Caract\u00e9risation des matrices totalement unimodulaires","volume":"254","author":"Ghouila-Houri","year":"1962","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/j.disopt.2026.100938_b23","first-page":"223","article-title":"Integral boundary points of convex polyhedra","volume":"38","author":"Hoffman","year":"1956","journal-title":"Ann. of Math. Stud."},{"key":"10.1016\/j.disopt.2026.100938_b24","series-title":"Vol. A, Algorithms and Combinatorics","article-title":"Combinatorial optimization. Polyhedra and efficiency","author":"Schrijver","year":"2003"},{"issue":"1","key":"10.1016\/j.disopt.2026.100938_b25","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Ann. Math."},{"key":"10.1016\/j.disopt.2026.100938_b26","series-title":"Introduction To Graph Theory","author":"West","year":"1996"},{"issue":"1\u20133","key":"10.1016\/j.disopt.2026.100938_b27","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0012-365X(93)90065-2","article-title":"An obvious proof of Fishburn\u2019s interval order theorem","volume":"118","author":"Bogart","year":"1993","journal-title":"Discrete Math."},{"issue":"101","key":"10.1016\/j.disopt.2026.100938_b28","first-page":"49","article-title":"Sur les repr\u00e9sentations minimales des semiordres et des ordres d\u2019intervalles","author":"Doignon","year":"1988","journal-title":"Math. Sci. Hum."},{"key":"10.1016\/j.disopt.2026.100938_b29","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","article-title":"Total dual integrality and integer polyhedra","volume":"25","author":"Giles","year":"1979","journal-title":"Linear Algebra Appl."},{"issue":"3\u20134","key":"10.1016\/j.disopt.2026.100938_b30","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF03322141","article-title":"The height of minimal Hilbert bases","volume":"32","author":"Henk","year":"1997","journal-title":"Results Math."},{"key":"10.1016\/j.disopt.2026.100938_b31","unstructured":"A. Seb\u0151, Hilbert bases, caratheodory\u2019s theorem and combinatorial optimization, in: Proceedings of the IPCO Conference, 1990, pp. 431\u2013455."},{"issue":"1\u20132","key":"10.1016\/j.disopt.2026.100938_b32","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-009-0294-5","article-title":"Recognizing conic TDI systems is hard","volume":"128","author":"Pap","year":"2011","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.disopt.2026.100938_b33","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/j.disopt.2026.100938_b34","doi-asserted-by":"crossref","first-page":"113","DOI":"10.2307\/2964389","article-title":"Foundational aspects of theories of measurement","volume":"23","author":"Scott","year":"1958","journal-title":"J. Symbolic Logic"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T11:34:17Z","timestamp":1777116857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":34,"alternative-id":["S1572528626000113"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100938","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The length polyhedron of an interval order","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100938","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100938"}}