{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:18Z","timestamp":1751367978718},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1007\/bf01586042","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:49Z","timestamp":1114677349000},"page":"69-86","source":"Crossref","is-referenced-by-count":40,"title":["Optimal partitions having disjoint convex and conic hulls"],"prefix":"10.1007","volume":"54","author":[{"given":"E. R.","family":"Barnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"Hoffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uriel G.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"E.R. Barnes","year":"1982","unstructured":"E.R. Barnes, \u201cAn algorithm for partitioning the nodes of a graph,\u201dSIAM Journal of Algebraic and Discrete Mathematics 3 (1982) 541\u2013550.","journal-title":"SIAM Journal of Algebraic and Discrete Mathematics"},{"key":"CR2","unstructured":"E.R. Barnes, \u201cPartitioning the nodes of a graph,\u201d manuscript (1985)."},{"key":"CR3","volume-title":"Progress in Combinatorial Optimization","author":"E.R. Barnes","year":"1984","unstructured":"E.R. Barnes and A.J. Hoffman, \u201cPartitioning, spectra and linear programming,\u201d in: W.E. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, New York, 1984)."},{"key":"CR4","unstructured":"E.R. Barnes, A. Vannelli and J.O. Walker, \u201cA new procedure for partitioning the nodes of a graph,\u201d IBM Research Report RC 10561 (June 1984)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.30.5.1018","volume":"30","author":"A.K. Chakravarty","year":"1982","unstructured":"A.K. Chakravarty, J.B. Orlin and U.G. Rothblum, \u201cA partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment,\u201dOperations Research 30 (1982) 1018\u20131022.","journal-title":"Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.33.4.820","volume":"33","author":"A.K. Chakravarty","year":"1985","unstructured":"A.K. Chakravarty, J.B. Orlin and U.G. Rothblum, \u201cConsecutive optimizors for a partitioning problem with applications to optimal inventory groupings for joint replenishment,\u201dOperations Research 33 (1985) 820\u2013834.","journal-title":"Operations Research"},{"key":"CR7","volume-title":"Dynamic Programming: Models and Applications","author":"E.V. Denardo","year":"1982","unstructured":"E.V. Denardo,Dynamic Programming: Models and Applications (Prentice Hall, Englewood Cliffs, NJ 1982)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W.E. Donath","year":"1973","unstructured":"W.E. Donath and A.J. Hoffman, \u201cLower bounds for partitioning of graphs,\u201dIBM Journal of Research and Development 17 (1973) 420\u2013425.","journal-title":"IBM Journal of Research and Development"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00933355","volume":"34","author":"F.K. Hwang","year":"1981","unstructured":"F.K. Hwang, \u201cOptimal partitions,\u201dJournal on Optimization Theory and Applications 34 (1981) 1\u201310.","journal-title":"Journal on Optimization Theory and Applications"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1137\/0606015","volume":"6","author":"F.K. Hwang","year":"1985","unstructured":"F.K. Hwang, J. Sun and E.Y. Yao, \u201cOptimal set partitioning,\u201dSIAM Journal on Algebraic and Discrete Mathematics 6 (1985) 163\u2013170.","journal-title":"SIAM Journal on Algebraic and Discrete Mathematics"},{"key":"CR11","volume-title":"Generating hyperplane partitions ofn points ink dimensions","author":"G. Ramfos","year":"1983","unstructured":"G. Ramfos, \u201cGenerating hyperplane partitions ofn points ink dimensions,\u201d Bachelor's Thesis, National Technical University of Athens (Athens, 1983). [In Greek.]"},{"key":"CR12","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586042\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:35Z","timestamp":1556897555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01586042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["BF01586042"],"URL":"https:\/\/doi.org\/10.1007\/bf01586042","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}