{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:29:07Z","timestamp":1726522147056},"reference-count":18,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0305-0548(96)00070-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"679-686","source":"Crossref","is-referenced-by-count":6,"title":["Partitioning of sequentially ordered systems using linear programming"],"prefix":"10.1016","volume":"24","author":[{"given":"Anito","family":"Joseph","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noel","family":"Bryson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00070-6_BIB1","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation: Part I. Graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell System Technical J."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.39.1.130","article-title":"Structured Partitioning Problems","volume":"39","author":"Anily","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00933355","article-title":"Optimal Partitions","volume":"34","author":"Hwang","year":"1981","journal-title":"J. Opt. Theory and Appl."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB5","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.30.5.1018","article-title":"A Partitioning Problem With Additive Objective With An Application to optimal inventory groupings for joint replenishment","volume":"30","author":"Chakravarty","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB6","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":"30","author":"Chakravarty","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/321623.321627","article-title":"Optimal sequential partitions of graphs","volume":"18","author":"Kernighan","year":"1971","journal-title":"J. Assoc. Computing Machinery"},{"year":"1993","series-title":"Cluster Analysis","author":"Everitt","key":"10.1016\/S0305-0548(96)00070-6_BIB8"},{"key":"10.1016\/S0305-0548(96)00070-6_BIB9","doi-asserted-by":"crossref","first-page":"789","DOI":"10.2307\/2281952","article-title":"On grouping for maximum homogeneity","volume":"53","author":"Fisher","year":"1958","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0130006","article-title":"The optimal partitioning of graphs","volume":"50","author":"Christofides","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB11","doi-asserted-by":"crossref","first-page":"622","DOI":"10.2307\/2283542","article-title":"Cluster analysis and mathematical programming","volume":"66","author":"Rao","year":"1971","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB12","doi-asserted-by":"crossref","first-page":"506","DOI":"10.2307\/2283635","article-title":"Integer programming and the theory of grouping","volume":"64","author":"Vinod","year":"1969","journal-title":"J. Am. Stat. Assoc."},{"year":"1988","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","key":"10.1016\/S0305-0548(96)00070-6_BIB13"},{"year":"1986","series-title":"LINDO: An Optimization Modeling System","author":"Schrage","key":"10.1016\/S0305-0548(96)00070-6_BIB14"},{"article-title":"Optimization Subroutine Library: Guide and Reference","year":"1990","author":"IBM","key":"10.1016\/S0305-0548(96)00070-6_BIB15"},{"key":"10.1016\/S0305-0548(96)00070-6_BIB16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0305-0548(91)90084-5","article-title":"Parametric programming and lagrangian relaxation: the case of the network problem with a single side-constraint","volume":"18","author":"Bryson","year":"1991","journal-title":"Comp. Oper. Res."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB17","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/0305-0548(93)90017-D","article-title":"A parametric programming methodology for solving the lagrangian dual of the network problem with multiple side-constraints","volume":"20","author":"Bryson","year":"1993","journal-title":"Comp. Oper. Res."},{"key":"10.1016\/S0305-0548(96)00070-6_BIB18","series-title":"Proc. IASTED Int. Conf. Applied Modelling, Simulation and Optimization","first-page":"133","article-title":"A Parametric Programming Procedure for Cluster Analysis","author":"Bryson","year":"1995"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000706?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000706?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:27:33Z","timestamp":1556382453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0305054896000706"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00070-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}