Separable concave optimization approximately equals piecewise linear optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3064, Issue , 2004, Pages 234-243

  Magnanti, Thomas L ^a   Stratila, Dan ^b  

^a Massachusetts Institute of Technology Cambridge   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COST FUNCTIONS; COSTS; LINEAR PROGRAMMING; PIECEWISE LINEAR TECHNIQUES;

CONCAVE MINIMIZATION; CONCAVE OPTIMIZATION; MINIMIZATION PROBLEMS; MIXED INTEGER MODELS; MULTICOMMODITY FLOW PROBLEMS; PIECEWISE LINEAR APPROXIMATIONS; PROBLEM INSTANCES; SOLUTION PROCEDURE;

INTEGER PROGRAMMING;

EID: 35048871019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25960-2_18     Document Type: Article

References (16)

1. 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.
2. Meyerson, A., Munagala, K., Plotkin, S.: Cost-distance: two metric network design. In: 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000). IEEE Comput. Soc. Press, Los Alamitos, CA (2000) 624-630
3. Munagala, K.: Approximation algorithms for concave cost network flow problems. PhD thesis, Stanford University, Department of Computer Science (2003)
4. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Prentice Hall Inc., Englewood Cliffs, NJ (1993) Theory, algorithms, and applications.
5. Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. Assoc. Comput. Mach. 37 (1990) 843-862
6. Balakrishnan, A., Magnanti, T.L., Wong, R.T.: A dual-ascent procedure for largescale uncapacitated network design. Oper. Res. 37 (1989) 716-740
7. Korte, B., Vygen, J.: Combinatorial optimization. Second edn. Volume 21 of Algorithms and Combinatorics. Springer-Verlag, Berlin (2002) Theory and algorithms.
8. Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Second edn. Volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin (1993)
9. Bauer, H.: Minimalstellen von Funktionen und Extremalpunkte. Arch. Math. 9 (1958) 389-393
10. Croxton, K.L., Gendron, B., Magnanti, T.L.: A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Science 49 (2003) 1268-1273
11. Guisewite, G.M., Pardalos, P.M.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25 (1990) 75-99 Computational methods in global optimization.
12. Ball, M.O., Magnanti, T.L., Monma, C.L., eds.: Network models. Volume 7 of Handbooks in Operations Research and Management Science. North-Holland Publishing Co., Amsterdam (1995)
13. Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Network design. In Dell'Amico, M., Maffioli, F., eds.: Annotated bibliographies in combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Ltd., Chichester (1997) 311-334 A Wiley-Interscience Publication.
14. 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. PWS Pub. Co., Boston (1997) 144-191
15. Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Vol. A. Volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin (2003) Paths, flows, matchings, Chapters 1-38.
16. Bell, G.J., Lamar, B.W.: Solution methods for nonconvex network flow problems. In: Network optimization (Gainesville, FL, 1996). Volume 450 of Lecture Notes in Econom. and Math. Systems. Springer, Berlin (1997) 32-50