{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:25:40Z","timestamp":1760707540149},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1007\/bf01594924","type":"journal-article","created":{"date-parts":[[2005,4,29]],"date-time":"2005-04-29T02:12:13Z","timestamp":1114740733000},"page":"53-73","source":"Crossref","is-referenced-by-count":11,"title":["A network penalty method"],"prefix":"10.1007","volume":"50","author":[{"given":"A. B.","family":"Gamble","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. R.","family":"Conn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1976","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms, (Addison-Wesley, Reading, MA, 1976)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0024-3795(80)90227-X","volume":"29","author":"R.H. Bartels","year":"1980","unstructured":"R.H. Bartels, \u201cA penalty linear programming method using reduced-gradient basis-exchange techniques,\u201dLinear Algebra and its Applications 29 (1980) 17\u201332.","journal-title":"Linear Algebra and its Applications"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0710063","volume":"10","author":"A.R. Conn","year":"1973","unstructured":"A.R. Conn, \u201cConstrained optimization using a nondifferentiable penalty function,\u201dSIAM Journal of Numerical Analysis 10 (1973) 760\u2013784.","journal-title":"SIAM Journal of Numerical Analysis"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1137\/0713016","volume":"13","author":"A.R. Conn","year":"1976","unstructured":"A.R. Conn, \u201cLinear programming via a nondifferentiable penalty function,\u201dSIAM Journal of Numerical Analysis 13 (1976) 145\u2013154.","journal-title":"SIAM Journal of Numerical Analysis"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"W.H. Cunningham","year":"1976","unstructured":"W.H. Cunningham, \u201cA network simplex method,\u201dMathematical Programming 11 (1976) 105\u2013116.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"W.H. Cunningham, \u201cTheoretical properties of the network simplex method,\u201dMathematics of Operations Research 4 (1979) 196\u2013208.","journal-title":"Mathematics of Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF02592054","volume":"26","author":"W.H. Cunningham","year":"1983","unstructured":"W.H. Cunningham and J.G. Klincewicz, \u201cOn cycling in the network simplex method,\u201dMathematical Programming 26 (1983) 182\u2013189.","journal-title":"Mathematical Programming"},{"key":"CR8","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968)."},{"key":"CR9","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher,Practical Methods of Optimization (Wiley, New York, 1987, 2nd ed.).","edition":"2nd ed."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","volume":"4","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Karney and D. Klingman, \u201cImplementation and computational comparisons of primal, dual, and primal\u2014dual computer codes for minimum cost network flow problems,\u201dNetworks 4 (1974) 191\u2013212.","journal-title":"Networks"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"M.D. Grigoriadis","year":"1986","unstructured":"M.D. Grigoriadis, \u201cAn efficient implementation of the network simplex method,\u201dMathematical Programming Study 26 (1986) 83\u2013111.","journal-title":"Mathematical Programming Study"},{"key":"CR12","volume-title":"Algorithms for Network Programming","author":"J.L. Kennington","year":"1980","unstructured":"J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, New York, 1980)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"D. Klingman, A. Napier and J. Stutz, \u201cNETGEN: A program for generating large-scale capacitated assignment, transportation, and minimum cost flow network problems,\u201dManagement Science 20 (1974) 814\u2013821.","journal-title":"Management Science"},{"key":"CR14","unstructured":"J.B. Orlin, \u201cGenuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problems,\u201d Technical Report, Sloan W.P. No. 1615-84, (M.I.T., 1984)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"E. Tardos, \u201cA strongly polynomial minimum cost circulation algorithm,\u201dCombinatorica 5 (1985) 247\u2013256.","journal-title":"Combinatorica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01594924.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01594924\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01594924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:48:39Z","timestamp":1556898519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01594924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF01594924"],"URL":"https:\/\/doi.org\/10.1007\/bf01594924","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}