{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T12:14:23Z","timestamp":1769170463248,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,4]],"date-time":"2018-09-04T00:00:00Z","timestamp":1536019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s12532-018-0145-6","type":"journal-article","created":{"date-parts":[[2018,9,4]],"date-time":"2018-09-04T05:49:27Z","timestamp":1536040167000},"page":"173-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Enumeration of 2-level polytopes"],"prefix":"10.1007","volume":"11","author":[{"given":"Adam","family":"Bohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Faenza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vissarion","family":"Fisikopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Macchia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanstantsin","family":"Pashkovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,4]]},"reference":[{"key":"145_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-0348-8438-9_5","volume-title":"Polytopes\u2014Combinatorics and Computation","author":"O Aichholzer","year":"2000","unstructured":"Aichholzer, O.: Extremal properties of 0\/1-polytopes of dimension 5. In: Ziegler, G., Kalai, G. (eds.) Polytopes\u2014Combinatorics and Computation, pp. 111\u2013130. Basel, Birkh\u00e4user (2000)"},{"key":"145_CR2","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1137\/17M1116684","volume":"32","author":"M Aprile","year":"2018","unstructured":"Aprile, M., Cevallos, A., Faenza, Y.: On 2-level polytopes arising in combinatorial settings. SIAM J. Discret. Math. 32, 1857\u20131886 (2018)","journal-title":"SIAM J. Discret. Math."},{"key":"145_CR3","doi-asserted-by":"crossref","unstructured":"Birkhoff, G.: Lattice Theory (American Mathematical Society Colloquium Publications), vol. 25, no. 2. American Mathematical Society (1940)","DOI":"10.1090\/coll\/025"},{"key":"145_CR4","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n Rev. Ser. A 5, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tucum\u00e1n Rev. Ser. A"},{"issue":"3","key":"145_CR5","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1090\/S0894-0347-2012-00733-4","volume":"25","author":"G Blekherman","year":"2012","unstructured":"Blekherman, G.: Nonnegative polynomials and sums of squares. J. Am. Math. Soc. 25(3), 617\u2013635 (2012)","journal-title":"J. Am. Math. Soc."},{"key":"145_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-662-48350-3_17","volume-title":"Algorithms\u2013ESA 2015. Lecture Notes in Computer Science","author":"A Bohn","year":"2015","unstructured":"Bohn, A., Faenza, Y., Fiorini, S., Fisikopoulos, V., Macchia, M., Pashkovich, K.: Enumeration of 2-level polytopes. In: Bansal, N., Finocchi, I. (eds.) Algorithms\u2013ESA 2015. Lecture Notes in Computer Science, vol. 9294, pp. 191\u2013202. Springer, Berlin (2015)"},{"issue":"2","key":"145_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(02)00209-3","volume":"127","author":"Nathalie Caspard","year":"2003","unstructured":"Caspard, Nathalie, Monjardet, Bernard: The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey. Discrete Appl. Math. 127(2), 241\u2013269 (2003)","journal-title":"Discrete Appl. Math."},{"key":"145_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Comb. Theory Ser. B 18, 138\u2013154 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"145_CR9","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G.: Combinatorial Optimization: Packing and Covering. CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898717105"},{"key":"145_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations","author":"J Loera De","year":"2010","unstructured":"De Loera, J., Rambau, J., Santos, F.: Triangulations, vol. 25. Springer, Berlin (2010)"},{"key":"145_CR11","doi-asserted-by":"publisher","unstructured":"Fiorini, S., Fisikopoulos, V., Macchia, M.: Two-level polytopes with a prescribed facet. In: Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, 16\u201318 May 2016, Revised Selected Papers, pp. 285\u2013296. \n                    https:\/\/doi.org\/10.1007\/978-3-319-45587-7_25","DOI":"10.1007\/978-3-319-45587-7_25"},{"issue":"2","key":"145_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00454-012-9470-0","volume":"49","author":"K Fukuda","year":"2013","unstructured":"Fukuda, K., Miyata, H., Moriyama, S.: Complete enumeration of small realizable oriented matroids. Discrete Comput. Geom. 49(2), 359\u2013381 (2013). (English)","journal-title":"Discrete Comput. Geom."},{"key":"145_CR13","first-page":"241","volume-title":"Beitr\u00e4ge zur Begriffsanalyse","author":"B Ganter","year":"1987","unstructured":"Ganter, B.: Algorithmen zur Formalen Begriffsanalyse. In: Ganter, B., Wille, R., Wolff, K.E. (eds.) Beitr\u00e4ge zur Begriffsanalyse, pp. 241\u2013254. B.I. Wissenschaftsverlag, Wien (1987)"},{"issue":"3","key":"145_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00383449","volume":"8","author":"B Ganter","year":"1991","unstructured":"Ganter, B., Reuter, K.: Finding all closed sets: a general approach. Order 8(3), 283\u2013290 (1991). (English)","journal-title":"Order"},{"key":"145_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis\u2014Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis\u2014Mathematical Foundations. Springer, Berlin (1999)"},{"issue":"11","key":"145_CR16","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: On the geometric interpretation of the nonnegative rank. Linear Algebra Appl. 437(11), 2685\u20132712 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"10","key":"145_CR17","doi-asserted-by":"publisher","first-page":"2921","DOI":"10.1016\/j.laa.2013.08.009","volume":"439","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Grappe, R., Kaibel, V., Pashkovich, K., Robinson, R.Z., Thomas, R.R.: Which nonnegative matrices are slack matrices? Linear Algebra Appl. 439(10), 2921\u20132933 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"145_CR18","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1137\/090746525","volume":"20","author":"J Gouveia","year":"2010","unstructured":"Gouveia, J., Parrilo, P., Thomas, R.: Theta bodies for polynomial ideals. SIAM J. Optim. 20(4), 2097\u20132118 (2010)","journal-title":"SIAM J. Optim."},{"key":"145_CR19","unstructured":"Gouveia, J., Pashkovich, K., Robinson, R.Z., Thomas, R.R.: Four dimensional polytopes of minimum positive semidefinite rank. J. Comb. Theory Ser. A 145, 184\u2013226 (2017)"},{"issue":"3","key":"145_CR20","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00454-013-9533-x","volume":"50","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Robinson, R., Thomas, R.: Polytopes of minimum positive semidefinite rank. Discrete Comput. Geom. 50(3), 679\u2013699 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"145_CR21","unstructured":"Grande, F.: On \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -level matroids: geometry and combinatorics. Ph.D. thesis, Free University of Berlin (2015)"},{"issue":"4","key":"145_CR22","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00454-015-9735-5","volume":"54","author":"F Grande","year":"2015","unstructured":"Grande, F., Ru\u00e9, J.: Many 2-level polytopes from matroids. Discrete Comput. Geom. 54(4), 954\u2013979 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"145_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2016.11.002","volume":"123","author":"F Grande","year":"2017","unstructured":"Grande, F., Sanyal, R.: Theta rank, levelness, and matroid minors. J. Comb. Theory Ser. B 123, 1\u201331 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"key":"145_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, vol. 2. Springer, Berlin (1993)"},{"key":"145_CR25","unstructured":"Hampe, S., Joswig, M., Benjamin, S.: Algorithms for tight spans and tropical linear spaces (2016). \n                    arXiv:1612.03592"},{"key":"145_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.7146\/math.scand.a-10456","volume":"4","author":"O Hanner","year":"1956","unstructured":"Hanner, O.: Intersections of translates of convex bodies. Math. Scand. 4, 65\u201387 (1956)","journal-title":"Math. Scand."},{"key":"145_CR27","doi-asserted-by":"publisher","first-page":"225","DOI":"10.7146\/math.scand.a-11716","volume":"41","author":"A Hansen","year":"1977","unstructured":"Hansen, A.: On a certain class of polytopes associated with independence systems. Math. Scand. 41, 225\u2013241 (1977)","journal-title":"Math. Scand."},{"issue":"3","key":"145_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0925-7721(02)00103-7","volume":"23","author":"Volker Kaibel","year":"2002","unstructured":"Kaibel, Volker, Pfetsch, Marc E.: Computing the face lattice of a polytope from its vertex-facet incidences. Comput. Geom. 23(3), 281\u2013290 (2002)","journal-title":"Comput. Geom."},{"issue":"1","key":"145_CR29","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01788696","volume":"5","author":"G Kalai","year":"1989","unstructured":"Kalai, G.: The number of faces of centrally-symmetric polytopes. Graphs Comb. 5(1), 389\u2013391 (1989)","journal-title":"Graphs Comb."},{"key":"145_CR30","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S Kuznetsov","year":"2002","unstructured":"Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14, 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"145_CR31","first-page":"137","volume-title":"Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics","author":"L Lov\u00e1sz","year":"2003","unstructured":"Lov\u00e1sz, L.: Semidefinite programs and combinatorial optimization. In: Reed, B.A., Sales, C.L. (eds.) Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, pp. 137\u2013194. Springer, Berlin (2003)"},{"key":"145_CR32","doi-asserted-by":"crossref","unstructured":"Lovasz, L., Saks, M.: Lattices, mobius functions and communications complexity. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, SFCS \u201988, pp. 81\u201390. IEEE Computer Society (1988)","DOI":"10.1109\/SFCS.1988.21924"},{"key":"145_CR33","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"145_CR34","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/002\/01","volume-title":"Introduction to a form of general analysis","author":"EH Moore","year":"1910","unstructured":"Moore, E.H.: Introduction to a form of general analysis. Yale University Press, New Haven (1910)"},{"key":"145_CR35","first-page":"1","volume":"22","author":"A Paffenholz","year":"2015","unstructured":"Paffenholz, A.: Faces of Birkhoff polytopes. Electron. J. Comb. 22, 1\u201367 (2015)","journal-title":"Electron. J. Comb."},{"key":"145_CR36","unstructured":"Pashkovich, K.: Extended formulations for combinatorial polytopes. Ph.D. thesis, Magdeburg Universit\u00e4t (2012)"},{"issue":"2","key":"145_CR37","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00454-008-9104-8","volume":"41","author":"R Sanyal","year":"2009","unstructured":"Sanyal, R., Werner, A., Ziegler, G.: On Kalai\u2019s conjectures concerning centrally symmetric polytopes. Discrete Comput. Geom. 41(2), 183\u2013198 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"145_CR38","unstructured":"Siek, J., Allison, C.: Boost 1.63 C++ libraries: Dynamic bitset 1.29.0. (2016) \n                    http:\/\/www.boost.org\/doc\/libs\/1_63_0\/libs\/dynamic_bitset\/dynamic_bitset.html\n                    \n                  . Accessed 7 May 2017"},{"key":"145_CR39","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0167-5060(08)70717-9","volume":"6","author":"R Stanley","year":"1980","unstructured":"Stanley, R.: Decompositions of rational convex polytopes. Ann. Discrete Math. 6, 333\u2013342 (1980)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"145_CR40","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02187680","volume":"1","author":"R Stanley","year":"1986","unstructured":"Stanley, R.: Two poset polytopes. Discrete Comput. Geom. 1(1), 9\u201323 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"145_CR41","doi-asserted-by":"publisher","first-page":"433","DOI":"10.2748\/tmj\/1163775139","volume":"58","author":"S Sullivant","year":"2006","unstructured":"Sullivant, S.: Compressed polytopes and statistical disclosure limitation. Tohoku Math. J. Second Ser. 58(3), 433\u2013445 (2006)","journal-title":"Tohoku Math. J. Second Ser."},{"key":"145_CR42","unstructured":"Walter, J., Koch, M.: Boost 1.63: Basic linear algebra library (2016) \n                    http:\/\/www.boost.org\/doc\/libs\/1_63_0\/libs\/numeric\/ublas"},{"issue":"3","key":"145_CR43","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"145_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G Ziegler","year":"1995","unstructured":"Ziegler, G.: Lectures on Polytopes, vol. 152. Springer, Berlin (1995)"},{"key":"145_CR45","first-page":"1","volume-title":"Polytopes\u2014Combinatorics and Computation, DMV Seminar","author":"G Ziegler","year":"2000","unstructured":"Ziegler, G.: Lectures on 0\/1-polytopes. In: Kalai, G., Ziegler, G. (eds.) Polytopes\u2014Combinatorics and Computation, DMV Seminar, vol. 29, pp. 1\u201341. Basel, Birkh\u00e4user (2000)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0145-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0145-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0145-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T19:03:55Z","timestamp":1567537435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0145-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,4]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["145"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0145-6","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,4]]},"assertion":[{"value":"4 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}