{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:05:53Z","timestamp":1751367953976},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0167-6377(99)00069-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:36:39Z","timestamp":1027636599000},"page":"159-163","source":"Crossref","is-referenced-by-count":8,"title":["Linear-shaped partition problems"],"prefix":"10.1016","volume":"26","author":[{"given":"Frank K","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Onn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uriel G","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00069-3_BIB1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0166-218X(98)00142-5","article-title":"Separable Partitions","volume":"91","author":"Alon","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(99)00069-3_BIB2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01586042","article-title":"Optimal partitions having disjoint convex and conic hulls","volume":"54","author":"Barnes","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00069-3_BIB3","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.33.4.820","article-title":"Consecutive optimizers for a partitioning problem with applications to optimal inventory groupings for joint replenishment","volume":"33","author":"Chakravarty","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(99)00069-3_BIB4","doi-asserted-by":"crossref","unstructured":"B. Gao, F.K. Hwang, W.-C.W. Li, U.G. Rothblum, Partition polytopes over 1-dimensional points, Math. Programming, in preparation.","DOI":"10.1007\/s101070050060"},{"key":"10.1016\/S0167-6377(99)00069-3_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0899-8256(91)90021-6","article-title":"The Pareto set of the partition bargaining game","volume":"3","author":"Granot","year":"1991","journal-title":"Games Econom. Behavior"},{"key":"10.1016\/S0167-6377(99)00069-3_BIB6","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 2nd Edition, Springer, Berlin, 1993.","DOI":"10.1007\/978-3-642-78240-4"},{"key":"10.1016\/S0167-6377(99)00069-3_BIB7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0024-3795(97)10092-1","article-title":"Representations and characterizations of the vertices of bounded-shape partition polytopes","volume":"278","author":"Hwang","year":"1998","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0167-6377(99)00069-3_BIB8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/S1052623497344002","article-title":"A polynomial-time algorithm for shaped partition problems","volume":"10","author":"Hwang","year":"1999","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(99)00069-3_BIB9","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/moor.21.3.540","article-title":"Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions","volume":"21","author":"Hwang","year":"1996","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(99)00069-3_BIB10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0097-3165(93)90086-N","article-title":"Geometry, complexity, and combinatorics of permutation polytopes","volume":"64","author":"Onn","year":"1993","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0167-6377(99)00069-3_BIB11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1006\/aama.1999.0645","article-title":"Cutting corners","volume":"23","author":"Onn","year":"1999","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0167-6377(99)00069-3_BIB12","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000693?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000693?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T07:28:21Z","timestamp":1555226901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0167637799000693"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00069-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}