{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:47:27Z","timestamp":1776106047149,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221135","type":"print"},{"value":"9783540259602","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_18","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T23:21:46Z","timestamp":1281309706000},"page":"234-243","source":"Crossref","is-referenced-by-count":11,"title":["Separable Concave Optimization Approximately Equals Piecewise Linear Optimization"],"prefix":"10.1007","author":[{"given":"Thomas L.","family":"Magnanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Stratila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Integer and combinatorial optimization","author":"G. Nemhauser","year":"1999","unstructured":"Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York (1999); Reprint of the 1988 original, A Wiley-Interscience Publication"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/SFCS.2000.892330","volume-title":"41st Annual Symposium on Foundations of Computer Science","author":"A. Meyerson","year":"2000","unstructured":"Meyerson, A., Munagala, K., Plotkin, S.: Cost-distance: two metric network design. In: 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, pp. 624\u2013630. IEEE Comput. Soc. Press, Los Alamitos (2000)"},{"key":"18_CR3","unstructured":"Munagala, K.: Approximation algorithms for concave cost network flow problems. PhD thesis, Stanford University, Department of Computer Science (2003)"},{"key":"18_CR4","volume-title":"Network flows, Theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows, Theory, algorithms, and applications. Prentice Hall Inc., Englewood Cliffs (1993)"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"D.S. Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. Assoc. Comput. Mach.\u00a037, 843\u2013862 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Magnanti, T.L., Wong, R.T.: A dual-ascent procedure for largescale uncapacitated network design. Oper. Res.\u00a037, 716\u2013740 (1989)","journal-title":"Oper. Res."},{"key":"18_CR7","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial optimization Theory and algorithms","author":"B. Korte","year":"2002","unstructured":"Korte, B., Vygen, J.: Combinatorial optimization Theory and algorithms, 2nd edn. Algorithms and Combinatorics, vol.\u00a021. Springer, Berlin (2002)","edition":"2"},{"key":"18_CR8","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, 2nd edn. Algorithms and Combinatorics, vol.\u00a02. Springer, Berlin (1993)","edition":"2"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01898615","volume":"9","author":"H. Bauer","year":"1958","unstructured":"Bauer, H.: Minimalstellen von Funktionen und Extremalpunkte. Arch. Math.\u00a09, 389\u2013393 (1958)","journal-title":"Arch. Math."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1287\/mnsc.49.9.1268.16570","volume":"49","author":"K.L. Croxton","year":"2003","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Science\u00a049, 1268\u20131273 (2003)","journal-title":"Management Science"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G.M. Guisewite","year":"1990","unstructured":"Guisewite, G.M., Pardalos, P.M.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res.\u00a025, 75\u201399 (1990), Computational methods in global optimization","journal-title":"Ann. Oper. Res."},{"key":"18_CR12","series-title":"Handbooks in Operations Research and Management Science","volume-title":"Network models","year":"1995","unstructured":"Ball, M.O., Magnanti, T.L., Monma, C.L. (eds.): Network models. Handbooks in Operations Research and Management Science, vol.\u00a07. North-Holland Publishing Co., Amsterdam (1995)"},{"key":"18_CR13","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","first-page":"311","volume-title":"Annotated bibliographies in combinatorial optimization","author":"A. Balakrishnan","year":"1997","unstructured":"Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Network design. In: Dell\u2019Amico, M., Maffioli, F. (eds.) Annotated bibliographies in combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, pp. 311\u2013334. John Wiley & Sons Ltd., Chichester (1997), A Wiley-Interscience Publication"},{"key":"18_CR14","first-page":"144","volume-title":"Approximation algorithms for NP-hard problems","author":"M. Goemans","year":"1997","unstructured":"Goemans, M., Williamson, D.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation algorithms for NP-hard problems, pp. 144\u2013191. PWS Pub. Co., Boston (1997)"},{"key":"18_CR15","series-title":"Algorithms and Combinatorics","first-page":"1","volume-title":"Polyhedra and efficiency Paths, flows, matchings, Chapters","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. In: Polyhedra and efficiency Paths, flows, matchings, Chapters. Algorithms and Combinatorics, vol.\u00a0A24, pp. 1\u201338. Springer, Berlin (2003)"},{"key":"18_CR16","series-title":"Lecture Notes in Econom. and Math. Systems","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/978-3-642-59179-2_3","volume-title":"Network optimization","author":"G.J. Bell","year":"1997","unstructured":"Bell, G.J., Lamar, B.W.: Solution methods for nonconvex network flow problems. In: Network optimization, Gainesville, FL, 1996. Lecture Notes in Econom. and Math. Systems, vol.\u00a0450, pp. 32\u201350. Springer, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:19:41Z","timestamp":1620011981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}