{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:32Z","timestamp":1747579532952},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"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":[[1977,12]]},"DOI":"10.1007\/bf01593766","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:13:01Z","timestamp":1114719181000},"page":"18-25","source":"Crossref","is-referenced-by-count":10,"title":["Using shortest paths in some transshipment problems with concave costs"],"prefix":"10.1007","volume":"12","author":[{"given":"Gery","family":"Daeninck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Smeers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/mnsc.17.1.66","volume":"17","author":"G. Alloin","year":"1970","unstructured":"G. Alloin, \u201cA simple method for a class of non-convex separable problems\u201d,Management Science 17 (1970) 66\u201377.","journal-title":"Management Science"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01585504","volume":"7","author":"R.S. Barr","year":"1974","unstructured":"R.S. Barr, F. Glover and D. Klingman, \u201cAn improved version of the out-of-kilter method and a comparative study of computer codes\u201d,Mathematical Programming 7 (1974) 60\u201386.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.18.1.82","volume":"18","author":"A.V. Cabot","year":"1970","unstructured":"A.V. Cabot and R.L. Francis, \u201cSolving certain non-convex quadratic minimization problems by ranking the extreme points\u201d,Operations Research 18 (1970) 82\u201386.","journal-title":"Operations Research"},{"key":"CR4","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, RI, 1963)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \u201cA note on two problems in connection with graphs\u201d,Numerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/03155986.1974.11731583","volume":"12","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Klingman and J. Stutz, \u201cAugmented threaded index method for network optimization\u201d,INFOR Canadian Journal of Operational Research and Information Processing 12 (1974) 293\u2013298.","journal-title":"INFOR Canadian Journal of Operational Research and Information Processing"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"E.L. Lawler, \u201cA procedure for computing theK best solutions to discrete optimization problems and its application to shorthest path problems\u201d,Management Science 18 (1972) 401\u2013405.","journal-title":"Management Science"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1002\/nav.3800220212","volume":"22","author":"P.G. McKeown","year":"1975","unstructured":"P.G. McKeown and D.S. Robin, \u201cAdjacent vertices on transportation polytopes\u201d,Naval Research Logistics Quarterly 22 (1975) 2.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K.G. Murty","year":"1968","unstructured":"K.G. Murty, \u201cSolving the fixed-charge problem by ranking extreme points\u201d,Operations Research 16 (1968) 268\u2013279.","journal-title":"Operations Research"},{"key":"CR10","first-page":"250","volume-title":"Applications of mathematical programming techniques","author":"L. Rech","year":"1970","unstructured":"L. Rech and G. Barton, \u201cA non-convex transportation algorithm\u201d, in: E. Beale, ed.,Applications of mathematical programming techniques (English Universities Press, London 1970) pp. 250\u2013260."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/nav.3800200313","volume":"20","author":"H.A. Taha","year":"1973","unstructured":"H.A. Taha, \u201cConcave minimization over a convex polyhedron\u201d,Naval Research Logistics Quarterly, 20 (1973) 533\u2013548.","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593766.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01593766\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:48:02Z","timestamp":1556898482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01593766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01593766"],"URL":"https:\/\/doi.org\/10.1007\/bf01593766","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}