{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T10:12:08Z","timestamp":1698228728998},"reference-count":20,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4332,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A new algorithm for generating structured, minimum cost network flow problems (transshipment, transportation, assignment, and shortest path) with known optimal solutions is described. The procedure is based on developing problems around an optimal basis so that the characteristics of solutions can be controlled. Computational tests show that the problems generated are as difficult to solve as are those produced by the commonly used generator NETGEN, while allowing the user a much greater degree of control over the resulting problems. \u00a9 1994 by John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/net.3230240805","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T19:18:15Z","timestamp":1178997495000},"page":"445-454","source":"Crossref","is-referenced-by-count":2,"title":["An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions"],"prefix":"10.1002","volume":"24","author":[{"given":"Jeffrey L.","family":"Arthur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr","given":"James O.","family":"Frendewey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Algorithms","author":"Aho V.","year":"1974"},{"key":"e_1_2_1_3_2","unstructured":"J. L.ArthurandJ. O.Frendewey Notes on using the random problem generators GENGUB and RAND_NET. Technical Report No. 158 Department of Statistics Oregon State University Corvallis OR (1993)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)90112-V"},{"key":"e_1_2_1_5_2","volume-title":"On the random generation of basis trees for minimum cost network flow problems. Working paper","author":"Arthur J. L.","year":"1993"},{"key":"e_1_2_1_6_2","first-page":"116","article-title":"Enhancements of spanning tree labelling procedures for network optimization","volume":"17","author":"Barr R. S.","year":"1979","journal-title":"INFOR"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"R. E.Bixby E. A.Boyd andR. R.Indovina A test set of real\u2010world mixed integer programming problems. Technical Report No. TR91\u201038 Department of Mathematical Sciences Rice University Houston TX (1991).","DOI":"10.21236\/ADA455431"},{"key":"e_1_2_1_8_2","volume-title":"NETGEN\u2010II: User's manual. Research Report, Center for Cybernetic Studies","author":"Burruss J.","year":"1980"},{"key":"e_1_2_1_9_2","unstructured":"J.Burruss J.Elam andD.Klingman The design of a generator for structured network\u2010based problems. Research Report Center for Cybernetic Studies The University of Texas at Austin Austin TX (1980)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/355826.355833"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-95406-1_3"},{"key":"e_1_2_1_12_2","first-page":"10","article-title":"Electronic mail distribution of linear programming test problems","volume":"13","author":"Gay D. M.","year":"1985","journal-title":"COAL Newsl."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.94"},{"key":"e_1_2_1_14_2","first-page":"22","article-title":"Computational experimentation: The case for rigorous testing","volume":"19","author":"Harris C. M.","year":"1992","journal-title":"OR\/MS Today"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588801"},{"key":"e_1_2_1_16_2","volume-title":"Algorithms for Network Programming","author":"Kennington J. L.","year":"1980"},{"key":"e_1_2_1_17_2","volume-title":"The C Programming Language","author":"Kernighan B.","year":"1989"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.814"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-95406-1_2"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.4.489"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230240805","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230240805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T03:23:27Z","timestamp":1698117807000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230240805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":20,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1002\/net.3230240805"],"URL":"https:\/\/doi.org\/10.1002\/net.3230240805","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,12]]}}}