{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:32Z","timestamp":1740145172787,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:00:00Z","timestamp":1544140800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Conicyt Fondecyt","award":["11150689"],"award-info":[{"award-number":["11150689"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11590-018-1369-0","type":"journal-article","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T05:49:57Z","timestamp":1544161797000},"page":"235-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matrices with lexicographically-ordered rows"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8072-7618","authenticated-orcid":false,"given":"Gustavo","family":"Angulo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"2","key":"1369_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1287\/moor.2014.0673","volume":"40","author":"G Angulo","year":"2014","unstructured":"Angulo, G., Ahmed, S., Dey, S.S., Kaibel, V.: Forbidden vertices. Math. Oper. Res. 40(2), 350\u2013360 (2014)","journal-title":"Math. Oper. Res."},{"key":"1369_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.dam.2017.04.022","volume":"240","author":"M Barbato","year":"2018","unstructured":"Barbato, M., Grappe, R., Lacroix, M., Pira, C.: Lexicographical polytopes. Discret. Appl. Math. 240, 3\u20137 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1369_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.orl.2014.11.008","volume":"43","author":"M Summa Di","year":"2015","unstructured":"Di Summa, M.: A short convex-hull proof for the all-different system with the inclusion property. Oper. Res. Lett. 43(1), 69\u201373 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1369_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2015.08.010","volume":"201","author":"A Gupte","year":"2016","unstructured":"Gupte, A.: Convex hulls of superincreasing knapsacks and lexicographic orderings. Discret. Appl. Math. 201, 150\u2013163 (2016)","journal-title":"Discret. Appl. Math."},{"key":"1369_CR5","doi-asserted-by":"publisher","unstructured":"Hojny, C., Pfetsch, M.E.: Polytopes associated with symmetry handling. Math. Program. (2018). \n                    https:\/\/doi.org\/10.1007\/s10107-018-1239-7","DOI":"10.1007\/s10107-018-1239-7"},{"key":"1369_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-13036-6_14","volume-title":"Branched Polyhedral Systems, Integer Programming and Combinatorial Optimization","author":"V Kaibel","year":"2010","unstructured":"Kaibel, V., Loos, A.: Branched Polyhedral Systems, Integer Programming and Combinatorial Optimization, pp. 177\u2013190. Springer, Berlin (2010)"},{"issue":"1","key":"1369_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.E.: Packing and partitioning orbitopes. Math. Program. 114(1), 1\u201336 (2008)","journal-title":"Math. Program."},{"issue":"3","key":"1369_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1014804110661","volume":"6","author":"J Lee","year":"2002","unstructured":"Lee, J.: All-different polytopes. J. Comb. Optim. 6(3), 335\u2013352 (2002)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"1369_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1287\/ijoc.1060.0178","volume":"19","author":"J Lee","year":"2007","unstructured":"Lee, J., Margot, F.: On a binary-encoded ILP coloring formulation. INFORMS J. Comput. 19(3), 406\u2013415 (2007)","journal-title":"INFORMS J. Comput."},{"key":"1369_CR10","unstructured":"Loos, A.: Describing Orbitopes by Linear Inequalities and Projection Based Tools, Ph.D. thesis (2011)"},{"issue":"1\u20132","key":"1369_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10107-010-0390-6","volume":"132","author":"D Magos","year":"2012","unstructured":"Magos, D., Mourtos, I., Appa, G.: A polyhedral approach to the all different system. Math. Program. 132(1\u20132), 209\u2013260 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1369_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/opre.38.1.127","volume":"38","author":"RK Martin","year":"1990","unstructured":"Martin, R.K., Rardin, R.L., Campbell, B.A.: Polyhedral characterization of discrete dynamic programming. Oper. Res. 38(1), 127\u2013138 (1990)","journal-title":"Oper. Res."},{"key":"1369_CR13","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)"},{"issue":"2","key":"1369_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1287\/ijoc.13.2.96.10515","volume":"13","author":"HP Williams","year":"2001","unstructured":"Williams, H.P., Yan, H.: Representations of the all\\_different predicate of constraint satisfaction in integer programming. INFORMS J. Comput. 13(2), 96\u2013103 (2001)","journal-title":"INFORMS J. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1369-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1369-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1369-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T19:16:52Z","timestamp":1575659812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1369-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["1369"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1369-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,12,7]]},"assertion":[{"value":"22 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}