{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T06:40:56Z","timestamp":1791268856388,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540609025","type":"print"},{"value":"9783540496700","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60902-4_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:02:55Z","timestamp":1330272175000},"page":"473-482","source":"Crossref","is-referenced-by-count":12,"title":["Decomposing linear programs for parallel solution"],"prefix":"10.1007","author":[{"given":"Ali","family":"Pinar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mustafa","family":"Pinar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"G. B. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operations Research, 8:101\u2013111, 1960.","journal-title":"Operations Research"},{"key":"50_CR2","volume-title":"Technical report TR1232","author":"M. C. Ferris","year":"1994","unstructured":"M. C. Ferris, and J. D. Horn. Partitioning mathematical programs for parallel solution. Technical report TR1232, Computer Sciences Department, University of Wisconsin Madison, May 1994."},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of the 19th ACM\/IEEE Design Automation Conference, pages 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"50_CR4","unstructured":"D. M. Gay, \u201cElectronic mail distribution of linear programming test problems\u201d Mathematical Programming Society COAL Newsletter, 1985."},{"key":"50_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01585159","volume":"62","author":"S. K. Gnanendran","year":"1993","unstructured":"S. K. Gnanendran and J. K. Ho. Load balancing in the parallel optimization of block-angular linear programs. Mathematical Programming, 62:41\u201367, 1993.","journal-title":"Mathematical Programming"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Technical Report 2, The Bell System Technical Journal, Feb. 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"issue":"5","key":"50_CR7","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"33","author":"B. Krishnamurthy","year":"1984","unstructured":"B. Krishnamurthy. An improved min-cut algorithm for partitioning VLSI networks. IEEE Transactions on Computers, 33(5):438\u2013446, 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"50_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01581138","volume":"66","author":"D. Medhi","year":"1994","unstructured":"D. Medhi. Bundle-based decomposition for large-scale convex optimization: error estimate and application to block-angular linear programs. Mathematical Programming, 66:79\u2013101, 1994.","journal-title":"Mathematical Programming"},{"issue":"2","key":"50_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.41.2.319","volume":"41","author":"S. S. Nielsen","year":"1993","unstructured":"S. S. Nielsen, and S. A. Zenios. A massively parallel algorithm for nonlinear stochastic network problems. Operations Research, 41(2):319\u2013337, 1993.","journal-title":"Operations Research"},{"issue":"1","key":"50_CR10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/12.8730","volume":"38","author":"L. A. Sanchis","year":"1989","unstructured":"L. A. Sanchis. Multiple-way network partitioning. IEEE Transactions on Computers, 38(1):62\u201381, 1989.","journal-title":"IEEE Transactions on Computers"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"D. G. Schweikert and B. W. Kernighan. A proper model for the partitioning of electrical circuits. In Proceedings of the 9th ACM\/IEEE Design Automation Conference, pages 57\u201362, 1972.","DOI":"10.1145\/800153.804930"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60902-4_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:02:27Z","timestamp":1605628947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60902-4_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609025","9783540496700"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60902-4_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}