About strongly polynomial time algorithms for quadratic optimization over submodular constraints

We present new strongly polynomial algorithms for special cases of convex separable quadratic minimization over submodular constraints. The main results are: an O(NM log(N2/M)) algorithm for the problemNetwork defined on a network onM arcs andN nodes; an O(n logn) algorithm for thetree problem onn variables; an O(n logn) algorithm for theNested problem, and a linear time algorithm for theGeneralized Upper Bound problem. These algorithms are the best known so far for these problems. The status of the general problem and open questions are presented as well.

[1]  Jadranka Skorin-Kapov,et al.  Some proximity and sensitivity results in quadratic integer programming , 1990, Math. Program..

[2]  Dorit S. Hochbaum,et al.  Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources , 1994, Math. Oper. Res..

[3]  Dorit S. Hochbaum,et al.  Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems , 1994, Math. Oper. Res..

[4]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[5]  J. George Shanthikumar,et al.  Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[6]  Nimrod Megiddo,et al.  Linear time algorithms for some separable quadratic programming problems , 1993, Oper. Res. Lett..

[7]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[8]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[9]  H. Groenevelt.  Two algorithms for maximizing a separable concave function over a polymatroid feasible region , 1991 .

[10]  Ron Shamir,et al.  A polynomial algorithm for an integer quadratic non-separable transportation problem , 1992, Math. Program..

[11]  Arie Tamir,et al.  A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks , 1993, Math. Program..

[12]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[13]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[14]  Martin E. Dyer,et al.  On an optimization problem with nested constraints , 1990, Discret. Appl. Math..

[15]  Felix F. Wu,et al.  Efficient integer optimization algorithms for optimal coordination of capacitors and regulators , 1990 .

[16]  Satoru Fujishige,et al.  Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector , 1980, Math. Oper. Res..

[17]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[18]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[19]  William J. Cook,et al.  Sensitivity theorems in integer linear programming , 1986, Math. Program..

[20]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[21]  P. Brucker.  Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .

[22]  Dorit S. Hochbaum,et al.  On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions , 1990, Conference on Integer Programming and Combinatorial Optimization.

[23]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .