{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:27:59Z","timestamp":1787383679018,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540620952","type":"print"},{"value":"9783540496434","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62095-8_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:35:26Z","timestamp":1330277726000},"page":"592-601","source":"Crossref","is-referenced-by-count":3,"title":["An effective model to decompose Linear Programs for parallel solution"],"prefix":"10.1007","author":[{"given":"Ali","family":"Pinar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"2","key":"64_CR1","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.38.2.240","volume":"38","author":"W. J. Carolan","year":"1990","unstructured":"W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann, An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications Operations Research 38(2):240\u2013248, 1990.","journal-title":"Operations Research"},{"key":"64_CR2","doi-asserted-by":"crossref","unstructured":"U. V. \u00c7atalyurek and C. Aykanat, Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication, Proc. of Irregular 96,1996, (to appear).","DOI":"10.1007\/BFb0030098"},{"key":"64_CR3","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":"64_CR4","unstructured":"D. M. Gay, \u201cElectronic mail distribution of linear programming test problems\u201d Mathematical Programming Society COAL Newsletter, 1985."},{"key":"64_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":"64_CR6","unstructured":"B. Hendrickson and R. Leland, A Multilevel Algorithm for Partitioning Graphs, Sandia National Laboratories, SAND93-1301, 1993."},{"key":"64_CR7","unstructured":"G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, Dept. of Computer Science, Univ. of Minnesota, 1995, TR 95\u2013035."},{"key":"64_CR8","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"},{"key":"64_CR9","unstructured":"C. E. Leiserson and J. G. Lewis, Orderings for parallel sparse symmetric factorization, 3rd SIAM Conf. Parallel Processing for Scientific Comp., 27\u201331, 1987"},{"key":"64_CR10","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"},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"A. Pinar, Decomposing Linear Programs for Parallel Solution M.S. Thesis, Bilkent University, July, 1996.","DOI":"10.1007\/3-540-60902-4_50"},{"key":"64_CR12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/3-540-60902-4_50","volume":"1041","author":"A. Pinar","year":"1996","unstructured":"A. Pinar, \u00dc. V. \u00c7atalyurek, C. Aykanat and M. Pmar, Decomposing Linear Programs for Parallel Solution Lecture Notes in Computer Science, 1041:473\u2013482 1996.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"64_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/98267.98287","volume":"16","author":"A. Pothen","year":"1990","unstructured":"A. Pothen and C. J. Fan, Computing the Block Triangular Form of a Sparse Matrix, ACM. Trans. on Math. Software, 16(4):303\u2013324, 1990.","journal-title":"ACM. Trans. on Math. Software"},{"key":"64_CR14","unstructured":"R. J. Vanderbei, LOQO User's Manual. Princeton University, November 1992."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing Industrial Computation and Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62095-8_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:12:12Z","timestamp":1605629532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62095-8_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620952","9783540496434"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-62095-8_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}