Complexity and algorithms for convex network optimization and other nonlinear problems

4OR

Volumn 3, Issue 3, 2005, Pages 171-216

  Hochbaum, Dorit S ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Convex network flow; Lower bounds on complexity; Nonlinear optimization; Strongly polynomial algorithms

Indexed keywords

EID: 26444618722     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-005-0078-6     Document Type: Article

References (84)

1. Ahuja RK, Orlin JB (2001) Inverse optimization. Operations Research 49: 771-783
2. Ahuja RK, Orlin JB (2001) A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Operations Research 49: 784-789
3. Ahuja RK, Batra JL, Gupta KS (1984) A parametric algorithm for the convex cost network flow and related problems. European Journal of Operational Research 16: 222-235
4. Ahuja RK, Hochbaum DS and Orlin JB (2003) Solving the convex cost integer dual network flow problem. Management Science 49: 950-964
5. Ahuja RK, Hochbaum DS, Orlin JB (2004) A cut based algorithm for the nonlinear dual of the minimum cost network flow problem. Algorithmica 39: 189-208
6. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall, New Jersey
7. Ahuja RK, Goldberg AV, Orlin JB, Tarjan RE (1992) Finding minimum-cost flows by double scaling. Mathematical Programming 53: 243-266
8. Baldick R (1991). A unification of polynomially solvable cases of integer 'non-separable' quadratic optimization. Lawrence Berkeley Laboratory, Manuscript
9. Baldick R, Wu FF (1990) Efficient integer optimization algorithms for optimal coordination of capacitators and regulators. IEEE Transactions on Power Systems 5: 805-812
10. Barahona F (1986) A solvable case of quadratic 0-1 programming. Discrete Applied. Mathematics 13: 23-28.
11. Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: theory and algorithms. Wiley, New York
12. Barlow RE, Bartholomew DJ, Bremer JM, Brunk HD (1972) Statistical inference under order restrictions. Wiley, New York
13. Slum M, Floyd RW, Pratt VR, Rivest RL, Tarjan RE (1972) Time bounds for selection. Journal of Computer Systems Science 7: 448-461
14. Busacker RG, Gowen PJ (1961) A procedure for determining minimal-cost network flow patterns. Operational Research Office, John Hopkins University, Baltimore, MD
15. Brucker P (1984) An O(n) algorithm for quadratic Knapsack problems. Operations Research Letters 3: 163-166
16. Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Mathematical Programming 53: 45-61
17. Burton D, Toint PhL (1994) On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming 63: 1-22
18. Cosares S, Hochbaum DS (1994) A strongly polynomial algorithm for the quadratic transportation problem with fixed number of suppliers. Mathematics of Operations Research 19: 94-111
19. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, New Jersey
20. Dennis JB (1959) Mathematical programming and electrical networks. Technology Press Research Monographs, Technology Press and Wiley, pp 74-75
21. Dikin II (1967) Iterative solution of problems of linear and quadratic programming. Soviet Mathematics Doklady 8: 674-675
22. Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. Journal of ACM 19: 248-264
23. Erickson RE, Monma CL, Veinott AF (1987) Send-and-split method for minimum-concave-cost network flows. Mathematics of Operations Resesarch 12: 634-664
24. Federgruen A, Groenevelt H (1986a) The greedy procedure for resource allocation problems: necessary and sufficient conditions for optimality. Operations Research 34: 909-918
25. Federgruen A, Groenevelt H (1986b) Optimal flows in networks with multiple sources and sinks, with applications to oil and gas lease investment programs. Operations Research 34: 218-225
26. Frederickson GN, Johnson DB (1982) The complexity of selection and rankings in X + Y and matrices with sorted columns. Journal of Computing System Science 24: 197-208
27. Fourer R (1988) A simplex algorithm for piecewise-linear programming: finiteness, feasibility and degeneracy. Mathematical Programming 41: 281-316
28. Gale D (1957) A theorem of flows in networks. Pacific Journal of Mathematics 7: 1073-1082
29. Gallo G, Grigoriadis MD, Tarjan RE (1989) A fast parametric maximum flow algorithm and applications. SIAM Journal of Computing 18: 30-55
30. Garey M, Johnson D (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York
31. Goldberg AV, Tarjan RE (1988) A new approach to the maximum flow problem. Journal of the ACM 35:921-940
32. Granot F, Skorin-Kapov J (1990) Some proximity and sensitivity results in quadratic integer programming. Mathematical Programming 47: 259-268
33. Guisewite G, Pardalos PM (1990) Minimum concave cost network flow problems: applications, complexity, and algorithms. Annals of Operations Research 25: 75-100
34. Hansen P, Simeone B (1986) Unimodular functions. Discrete Applied Mathematics 14: 269-281
35. Hochbaum DS (1989) On a polynomial class of nonlinear optimization problems. U.C. Berkeley, Manuscript
36. Hochbaum DS (1993) Polynomial algorithms for convex network optimization. In: Du D, Pardalos PM (eds): Network optimization problems: Algorithms, complexity and applications. World Scientific, Singapore, pp 63-92
37. Hochbaum DS (1994) Lower and upper bounds for allocation problems. Mathematics of Operations Research 19: 390-409
38. Hochbaum DS (1995) A nonlinear Knapsack problem. Operations Research Letters 17: 103-110
39. Hochbaum DS (2001) An efficient algorithm for image segmentation, Markov random fields and related problems. Journal of the ACM 48: 686-701
40. Hochbaum DS (2002) The inverse shortest paths problem. UC Berkeley, Manuscript
41. Hochbaum DS (2003a) The pseudoflow algorithm for the maximum flow problem. UC Berkeley, Manuscript, revised 2003.
42. Extended abstract in: Bixby RE, Boyd EA, Rios-Mercado Z (eds) The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem. Proceedings of IPCO98, June 1998 (Lecture Notes in Computer Science 1412). Springer, Berlin Heidelberg New York, pp 325-337
43. Hochbaum DS (2003b) Efficient algorithms for the inverse spanning tree problem. Operations Research 51:785-797
44. Hochbaum DS (2004) Selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today. Management Science 50: 709-723
45. Hochbaum DS, Hong SP (1995) About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Mathematical Programming 69: 269-309
46. Hochbaum DS, Hong SP (1996) On the complexity of the production- transportation problem. SIAM Journal on Optimization 6: 250-264
47. Hochbaum DS, Queyranne M (2003) The convex cost closure problem. SIAM Journal on Discrete Mathematics 16: 192-207
48. Hochbaum DS, Seshadri S (1993) The empirical performance of a polynomial algorithm for constrained nonlinear optimization. Annals of Operations Research 43: w229-248
49. Hochbaum DS, Shanthikumar JG (1990) Convex separable optimization is not much harder than linear optimization. Journal of the ACM 37: 843-862
50. Hochbaum DS, Shamir R, Shanthikumar JG (1992) A polynomial algorithm for an integer quadratic nonseparable transportation problem. Mathematical Programming 55: 359-372
51. Hoffman AJ (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Bellman R, Hall M Jr. (eds) Proceedings of Symposia in Applied Mathematics vol X, Combinatorial Analysis (American mathematical Society, Providence) pp 113-127
52. Ibaraki T, Katoh N (1988) Resource allocation problems: algorithmic approaches. MIT Press, Boston
53. Iri M (1960) A new method of solving transportation network problems. Journal of the Operations Research Society of Japan 3: 27-87
54. Jewell WS (1958) Optimal flow through networks. Technical report No. 8, Operations research Center, MIT Cambridge, MA
55. Kapoor S, Vaidya PM (1986) Fast algorithms for convex quadratic programming and multicommodity flows. Proceedings of the 18th Symposium on Theory Of Computing, pp 147-159
56. Karzanov AV, McCormick ST (1997) Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal on Computing 26: 1245-1275
57. Knuth D (1973) The art of computer programming, vol. 3, sorting and searching. Addison Wesley, Reading, Mass.
58. Kozlov MK, Tarasov SP, Khachian LG (1979) Polynomial solvability of convex quadratic programming. Doklady Akad. Nauk SSR 5: 1051-1053
59. [Translated in Soviet Mathematics Doklady 20: 1108-1111 (1979)]
60. Lawler E (1979) Fast approximation algorithms for Knapsack problems. Mathematics of Operations Research 4: 339-356
61. Mansour Y, Schieber B, Tiwari P (1991) Lower bounds for computations with the floor operation. SIAM Journal on Computing 20: 315-327
62. Megiddo N, Tamir A (1993) Linear time algorithms for some separable quadratic programming problems. Operations Research Letters 13: 203-211
63. Minoux M (1984) A polynomial algorithm for minimum quadratic cost flow problems. European Journal of Operational Research 18: 377-387
64. Minoux M (1986) Solving integer minimum cost flows with separable convex cost objective polynomially. Mathematical Programming Study 26: 237-239
65. Minoux M (1986) Mathematical programming, theory and algorithms. Wiley, New York, Chaps. 5,6
66. Monteiro RDC, Adler I (1989) Interior path following primal-dual algorithms. Part II: convex quadratic programming. Mathematical Programming 44: 43-66
67. Moriguchi S, Shioura A (2004) On Hochbaum's proximity-scaling algorithm for the general resource allocation problem. Mathematics of Operations Research 29: 394-397
68. Murty KG, Kabadi SN (1987) Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming 39: 117-129
69. Nemirovsky AS, Yudin DB (1983) Problem complexity and method efficiency in optimization. Wiley, New York
70. Picard JC (1976) Maximal closure of a graph and applications to combinatorial problems, Management Science 22: 1268-1272
71. Picard J-C, Queyranne M (1982) Selected applications of minimum cuts in networks. INFOR 20: 394-422
72. Papadimitiou CH, Steiglitz K (1982) Combinatorial optimization: algorithms and complexity. Prentice Hall, New Jersey
73. Pinto Y, Shamir R (1994) Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs. Algorithmica 11(3): 256-276
74. Radzik T (1993) Parametric flows, Weighted means of cuts, and fractional combinatorial optimization. In: Pardalos PM (ed) Complexity in numerical optimization. World Scientific, Singapore, pp 351-386
75. Renegar J (1987) On the worst case arithmetic complexity of approximation zeroes of polynomials. Journal of Complexity 3: 90-113
76. Sahni S (1974) Computationally related problems. SIAM Journal on Computing 3: 262-279
77. Shub M, Smale S (1996) Computational complexity: on the geometry of polynomials and a theory of cost, II. SIAM Journal on Computing 15: 145-161
78. Sun J, Tsai K-H, Qi L (1993) A simplex method for network programs with convex separable piecewise linear costs and its application to stochastic transshipment problems. In: Du D, Pardalos PM (eds) Network optimization problems: algorithms, complexity and applications World Scientific, Singapore, pp 283-300
79. Tamir A (1993) A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on series-parallel networks. Mathematical Programming 59: 117-132
80. Tardos E (1985) A strongly polynomial minimum cost circulation algorithm. Combinatorica 5:241-255
81. Tardos E (1986) A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34: 250-256
82. Värbrand P, Tuy H, Ghannadan S, Migdalas A (1995) The minimum concave cost network flow problems with fixed number of sources and non-linear arc costs. Journal of Global Optimisation 6: 135-151
83. Värbrand P, Tuy H, Ghannadan S, Migdalas A (1996) A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of non-linear variables. Mathematical Programming 72: 229-258
84. Werman M, Magagnosc M (1992) The relationship between integer and real solutions of constrained convex programming. Mathematical Programming 51: 133-135