{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:00:50Z","timestamp":1760061650938},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9063-7","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T21:27:40Z","timestamp":1175290060000},"page":"153-164","source":"Crossref","is-referenced-by-count":4,"title":["The use of edge-directions and linear programming to enumerate vertices"],"prefix":"10.1007","volume":"14","author":[{"given":"Shmuel","family":"Onn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uriel G.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"9063_CR1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1080\/00029890.1943.11991447","volume":"50","author":"RC Buck","year":"1943","unstructured":"Buck RC (1943) Partition of space. Am Math Mon 50:541\u2013544","journal-title":"Am Math Mon"},{"key":"9063_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial optimization","author":"WJ Cook","year":"1997","unstructured":"Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley, New York"},{"key":"9063_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner H, O\u2019Rourke J, Seidel R (1986) Constructing arrangements of lines and hyperplanes with applications. SIAM J Comput 15:341\u2013363","journal-title":"SIAM J Comput"},{"key":"9063_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BFb0038185","volume-title":"New results and trends in computer science","author":"H Edelsbrunner","year":"1991","unstructured":"Edelsbrunner H, Seidel R, Sharir M (1991) On the zone theorem for hyperplane arrangements. In: New results and trends in computer science. Lecture notes in computer science, vol 555. Springer, Berlin, pp 108\u2013123"},{"key":"9063_CR5","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0406019","volume":"6","author":"P Gritzmann","year":"1993","unstructured":"Gritzmann P, Sturmfels B (1993) Minkowski addition of polytopes: complexity and applications to Gr\u00f6bner bases. SIAM J Discret Math 6:246\u2013269","journal-title":"SIAM J Discret Math"},{"key":"9063_CR6","volume-title":"Convex polytopes","author":"B Gr\u00fcnbaum","year":"1967","unstructured":"Gr\u00fcnbaum B (1967) Convex polytopes. Wiley, New York"},{"key":"9063_CR7","doi-asserted-by":"crossref","unstructured":"Harding EF (1967) The number of partitions of a\u00a0set of n points in k dimensions induced by hyperplanes. In: Proceedings of the Edinburgh mathematical society, vol 15, pp 285\u2013289","DOI":"10.1017\/S0013091500011925"},{"key":"9063_CR8","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/moor.21.3.540","volume":"21","author":"FK Hwang","year":"1996","unstructured":"Hwang FK, Rothblum UG (1996) Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions. Math Oper Res 21:540\u2013554","journal-title":"Math Oper Res"},{"key":"9063_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/S1052623497344002","volume":"10","author":"FK Hwang","year":"1999","unstructured":"Hwang FK, Onn S, Rothblum UG (1999) A polynomial time algorithm for shaped partition problems. SIAM J Optim 10:70\u201381","journal-title":"SIAM J Optim"},{"key":"9063_CR10","volume-title":"Inequalities: theory of majorization and its applications","author":"AW Marshall","year":"1979","unstructured":"Marshall AW, Olkin I (1979) Inequalities: theory of majorization and its applications. Academic, New York"},{"key":"9063_CR11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00454-004-1138-y","volume":"32","author":"S Onn","year":"2004","unstructured":"Onn S, Rothblum UG (2004) Convex combinatorial optimization. Discret Comput Geom 32:549\u2013566","journal-title":"Discret Comput Geom"},{"key":"9063_CR12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1287\/moor.26.3.583.10587","volume":"26","author":"S Onn","year":"2001","unstructured":"Onn S, Schulman LJ (2001) The vector partition problem for convex objective functions. Math Oper Res 26:583\u2013590","journal-title":"Math Oper Res"},{"key":"9063_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10898-004-4313-z","volume":"33","author":"S Onn","year":"2005","unstructured":"Onn S, Rothblum UG, Tangir Y (2005) Edge-directions of polyhedra with applications to network flows. J Global Optim 33:109\u2013122","journal-title":"J Global Optim"},{"key":"9063_CR14","series-title":"Pure and applied mathematics","volume-title":"Network flows and monotropic optimization","author":"RT Rockaffelar","year":"1984","unstructured":"Rockaffelar RT (1984) Network flows and monotropic optimization. Pure and applied mathematics. Wiley\u2013Interscience, New York"},{"key":"9063_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/3-540-60313-1_164","volume-title":"Proceedings of the third annual European symposium on algorithms","author":"AS Schulz","year":"1995","unstructured":"Schulz AS, Weismantel R, Ziegler G (1995) (0,1)-integer programming: optimization and augmentation are equivalent. In: Proceedings of the third annual European symposium on algorithms. Lecture notes in computer science, vol 979. Springer, Berlin, pp 473\u2013483"},{"key":"9063_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02283701","volume":"25","author":"F Tardella","year":"1990","unstructured":"Tardella F (1990) On the equivalence between some discrete and continuous optimization problems. Ann Oper Res 25:291\u2013300","journal-title":"Ann Oper Res"},{"key":"9063_CR17","doi-asserted-by":"crossref","unstructured":"Zaslavsky T (1975) Facing up to arrangements: face count formulas for partitions of space by hyperplanes. Mem Am Math Soc 154","DOI":"10.1090\/memo\/0154"},{"key":"9063_CR18","series-title":"Graduate texts in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lecture notes on polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler GM (1995) Lecture notes on polytopes. Graduate texts in mathematics. Springer, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9063-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9063-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9063-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9063-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9063"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9063-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}