{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:27:29Z","timestamp":1760488049861},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0166-218x(00)00286-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"243-260","source":"Crossref","is-referenced-by-count":3,"title":["Partitioning a matrix with non-guillotine cuts to minimize the maximum cost"],"prefix":"10.1016","volume":"116","author":[{"given":"Aristide","family":"Mingozzi","sequence":"first","affiliation":[]},{"given":"Serena","family":"Morigi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00286-9_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(00)00286-9_BIB2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","article-title":"An exact two-dimensional non guillotine cutting tree search procedure","volume":"33","author":"Beasley","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00286-9_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<115::AID-NET4>3.0.CO;2-E","article-title":"Max\u2013min partitioning of grid graphs into connected components","volume":"32","author":"Becker","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00286-9_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The lagrangean relaxation method for solving integer Programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(00)00286-9_BIB5","series-title":"Parallel Processing for Computer Graphics","author":"Green","year":"1991"},{"key":"10.1016\/S0166-218X(00)00286-9_BIB6","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1016\/0167-8191(93)90027-I","article-title":"Load balancing data parallel programs on distributed memory computers","volume":"19","author":"De Keyser","year":"1993","journal-title":"Parallel Comput."},{"key":"10.1016\/S0166-218X(00)00286-9_BIB7","unstructured":"A. Mingozzi, S. Morigi, Min\u2013max partitioning of a matrix with non-guillotine cuts, Technical Report, Department of Math., University of Bologna, 1996."},{"key":"10.1016\/S0166-218X(00)00286-9_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0166-218X(94)00154-6","article-title":"Partitioning a matrix to minimize the maximum cost","volume":"62","author":"Mingozzi","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00286-9_BIB9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01901486","article-title":"Static load balancing for a parallel ray tracing on a MIMD hypercube","volume":"5","author":"Priol","year":"1989","journal-title":"Visual Comput."},{"key":"10.1016\/S0166-218X(00)00286-9_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/2.179115","article-title":"Load distributing for locally distributed systems","volume":"25","author":"Shivaratri","year":"1992","journal-title":"IEEE Comput."},{"key":"10.1016\/S0166-218X(00)00286-9_BIB11","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1002\/cpe.4330030502","article-title":"Performance of dynamic load balancing algorithms for unstructured mesh calculations","volume":"3","author":"Williams","year":"1991","journal-title":"Concurrency: Practice Experience"},{"key":"10.1016\/S0166-218X(00)00286-9_BIB12","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1016\/S0167-8191(97)00063-X","article-title":"A load balancing package on distributed memory systems and its application to particle\u2013particle, particle\u2013particle mesh methods","volume":"23","author":"Yuan","year":"1997","journal-title":"Parallel Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002869?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002869?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:27:14Z","timestamp":1556584034000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0166218X00002869"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00286-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}