A submodular optimization problem with side constraints

Mathematics of Operations Research

Volumn 23, Issue 3, 1998, Pages 661-679

  Hartvigsen, David ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINED BASED ALGORITHM;

OPERATIONS RESEARCH;

EID: 0032131573     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.3.661     Document Type: Article

References (18)

1. Brown, J. R. (1979). The sharing problem. Oper. Res. 27 324-340.
2. Dinic, E. A. (1970). Algorithm for a solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 2 1277-1280
3. Edmonds, J. (1970). Submodular functions, matroids, and certain polyhedra. R. K. Guy, H. Hanoni, N. Sauer, and J. Schonheim, eds. Combinatorial Structures and Their Applications, Gordon and Breach, New York, 69-87.
4. _, R. M. Karp (1972). Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19 248-264.
5. Ford, L. R., D. R. Fulkerson (1956). Maximal flow through a network. Canadian J. Math. 8 399-404.
6. Fujishige, S. (1991). Submodular Functions and Optimization. North Holland, Amsterdam.
7. _ (1984). Submodular systems and related topics. Math. Programming Study 22 113-131.
8. Fulkerson, D. R. (1968). Networks, frames, blocking systems. G. B. Dantzig and A. F. Veinott, Jr., eds. Mathematics of the Decision Sciences, Part 1, Lectures in Applied Mathematics Vol. 11, American Mathematical Society, Providence, RI, 303-334.
9. Hall, N. G., R. V. Vohra (1993). Towards equitable distribution via proportional equity constraints. Math. Programming 58 287-294.
10. Ichimori, T., H. Ishii, T. Nishida (1982). Optimal sharing. Math. Programming 23 341-348.
11. Lovasz, L. (1983). Submodular functions and convexity. A. Machem, M. Grotschel, and B. Korte, eds. Mathematical Programming - The State of the Art, Springer, Berlin, 235-257.
12. _, M. D. Plummer (1986). Matching Theory. North Holland, Amsterdam.
13. McCormick, S. T., T. R. Ervolina (1994). Computing maximum mean cuts. Discrete Appl. Math. 52 53-70.
14. Megiddo, N. (1983). Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30 852-865.
15. Radzik, T. (1993). Parametric flows, weighted means of cuts, and fractional combinatorial optimization P. Pardalos, ed. Complexity in Numerical Optimization, World Scientific, 351-386.
16. Schrijver, A. (1986). Theory of Linear and Integer Programming. John Wiley & Sons, New York.
17. Tardos, E. (1986). A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34 250-256.
18. Zimmerman, U. (1986). Duality for balanced submodular flows. Disc. Appl. Math. 15 365-376.