A Submodular Optimization Problem with Side Constraints

Published Online:https://doi.org/10.1287/moor.23.3.661

References

  • Brown J. R. The sharing problem. Oper. Res. (1979) 27 324 340 LinkGoogle Scholar
  • Dinic E. A. Algorithm for a solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. (1970) 2 1277 1280 Google Scholar
  • Edmonds J. , Guy R. K. , Hanoni H. , Sauer N. , Schonheim J. Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and Their Applications (1970) (Gordon and Breach, New York) 69 87 Google Scholar
  • Edmonds J. , Karp R. M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM (1972) 19 248 264 CrossrefGoogle Scholar
  • Ford L. R. , Fulkerson D. R. Maximal flow through a network. Canadian J. Math. (1956) 8 399 404 CrossrefGoogle Scholar
  • Fujishige S. Submodular Functions and Optimization (1991) (North Holland, Amsterdam) Google Scholar
  • Fujishige S. Submodular systems and related topics. Math. Programming Stud. (1984) 22 113 131 CrossrefGoogle Scholar
  • Fulkerson D. R. , Dantzig G. B. , Veinott A. F. Networks, frames, blocking systems. Mathematics of the Decision Sciences (1968) 11 (American Mathematical Society, Providence, RI) 303 334 . Part 1, Lectures in Applied Mathematics Google Scholar
  • Hall N. G. , Vohra R. V. Towards equitable distribution via proportional equity constraints. Math. Programming (1993) 58 287 294 CrossrefGoogle Scholar
  • Ichimori T. , Ishii H. , Nishida T. Optimal sharing. Math. Programming (1982) 23 341 348 CrossrefGoogle Scholar
  • Lovasz L. , Machem A. , Grotschel M. , Korte B. Submodular functions and convexity. Mathematical Programming—The State of the Art (1983) (Springer, Berlin) 235 257 CrossrefGoogle Scholar
  • Lovasz L. , Plummer M. D. Matching Theory (1986) (North Holland, Amsterdam) Google Scholar
  • McCormick S. T. , Ervolina T. R. Computing maximum mean cuts. Discrete Appl. Math. (1994) 52 53 70 CrossrefGoogle Scholar
  • Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM (1983) 30 852 865 CrossrefGoogle Scholar
  • Radzik T. , Pardalos P. Parametric flows, weighted means of cuts, and fractional combinatorial optimization. Complexity in Numerical Optimization (1993) (World Scientific) 351 386 CrossrefGoogle Scholar
  • Schrijver A. Theory of Linear and Integer Programming (1986) (John Wiley & Sons, New York) Google Scholar
  • Tardos E. A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. (1986) 34 250 256 LinkGoogle Scholar
  • Zimmerman U. Duality for balanced submodular flows. Disc. Appl. Math. (1986) 15 365 376 CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.