{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T10:11:54Z","timestamp":1698228714918},"reference-count":17,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4607,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1994,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A bounded generalized processing network model has the structure of a cost\u2010minimizing generalized network, with additional side constraints that, for flows on some arcs, place upper and lower bounds that are proportional to flows on other arcs. We propose and test a heuristic algorithm that takes advantage of the near\u2010network structure by solving a sequence of generalized network LPs whose data are adjusted in a manner suggested by the solution at previous steps. The algorithm extends an earlier algorithm to achieve better solutions, at the cost of more computing effort. In tests, the algorithm is much faster than is application of the general purpose linear programming code MINOS, and the speed advantage increases with problem size: The algorithm is 27 times faster than MINOS on the largest test problem. The algorithm almost always obtains solutions within 0.05% of the optimum. The proportionality constraints are relaxed in the algorithm, yet the solutions to the test problems satisfy the proportionality constraints to within, at worst, 0.25% of the given proportionality limits. \u00a9 1994 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/net.3230240202","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T17:22:09Z","timestamp":1178990529000},"page":"57-67","source":"Crossref","is-referenced-by-count":0,"title":["A fast algorithm for bounded generalized processing networks"],"prefix":"10.1002","volume":"24","author":[{"given":"J. David","family":"Fuller","sequence":"first","affiliation":[]},{"given":"B.","family":"Lan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.30.2.281"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90012-4"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585504"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(88)90022-6"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.32.12.1582"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121099"},{"key":"e_1_2_1_8_2","unstructured":"J. D.FullerandB.Lan An algorithm for bounded generalized processing networks: Theory and tests. Working Paper 191\u2010MS\u20101990 Department of Management Sciences University of Waterloo. Waterloo Ontario Canada N2L 3G1 (1990)."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0360-5442(90)90038-4"},{"key":"e_1_2_1_10_2","unstructured":"R.Glover User documentation and analyst documentation for GN2PC. Contract Optimization Software 2690 Iliff St. Boulder CO 80303 (1989)."},{"key":"e_1_2_1_11_2","unstructured":"R.Glover Letter(1989)."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121048"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580728"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1984.124"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.12.1209"},{"key":"e_1_2_1_16_2","volume-title":"Minimal Cost Flow in Processing Networks, A Primal Approach","author":"Koene J.","year":"1983"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588950"},{"key":"e_1_2_1_18_2","unstructured":"D. J.Shields J. A.Henry andJ. C.Bettinger A microcomputer\u2010based network flow model presented at the CORS\/TIMS\/ORSA Conference in Vancouver Canada (1989)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230240202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230240202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T14:38:26Z","timestamp":1698158306000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230240202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["10.1002\/net.3230240202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230240202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}