50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today

Motivated by applications in freight handling and open-pit mining, Rhys, Balinski, and Picard studied the problems of selection and closure in papers published inManagement Science in 1970 and 1976. They identified efficient algorithms based on linear programming and maximum-flow/minimum-cut procedures to solve these problems. This research has had major impact well beyond the initial applications, reaching across three decades and inspiring work on numerous applications and extensions. The extensions are nontrivial optimization problems that are of theoretical interest. The applications ranged from evolving technologies, image segmentation, revealed preferences, pricing, adjusting utilities for consistencies, just-in-time production, solving certain integer programs in polynomial time, and providing efficient 2-approximation algorithms for a wide variety of hard problems. A recent generalization to a convex objective function has even produced novel solutions to prediction and Bayesian estimation problems. This paper surveys the streams of research stimulated by these papers as an example of the impact ofManagement Science on the optimization field and an illustration of the far-reaching implications of good original research.

[1]  William L. Maxwell,et al.  Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems , 1985, Oper. Res..

[2]  W. T. Huh,et al.  Optimal capacity expansion for multi-product, multi-machine manufacturing systems with stochastic demand , 2004 .

[3]  Joseph Naor,et al.  Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality , 1993, Math. Program..

[4]  Thys B Johnson,et al.  OPTIMUM OPEN PIT MINE PRODUCTION SCHEDULING , 1968 .

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

[6]  Dorit S. Hochbaum,et al.  An efficient algorithm for image segmentation, Markov random fields and related problems , 2001, JACM.

[7]  Edward I. Altman,et al.  FINANCIAL RATIOS, DISCRIMINANT ANALYSIS AND THE PREDICTION OF CORPORATE BANKRUPTCY , 1968 .

[8]  Maurice Queyranne,et al.  Minimizing a Convex Cost Closure Set , 2003, SIAM J. Discret. Math..

[9]  Dorit S. Hochbaum,et al.  A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem , 2004, Algorithmica.

[10]  Jr. Arthur F. Veinott.  Least d-Majorized Network Flows with Inventory and Statistical Applications , 1971 .

[11]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[12]  D. Gale.  A theorem on flows in networks , 1957 .

[13]  John W. Mamer,et al.  Optimizing Field Repair Kits Based on Job Completion Rate , 1982 .

[14]  D. Hochbaum,et al.  Forest Harvesting and Minimum Cuts: A New Approach to Handling Spatial Constraints , 1997 .

[15]  Tomasz Radzik,et al.  Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization , 1993 .

[16]  Robin O. Roundy,et al.  A continuous‐time strategic capacity planning model , 2005 .

[17]  R. Roundy.  98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems , 1985 .

[18]  Ravindra K. Ahuja,et al.  A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints , 2001, Oper. Res..

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

[20]  L. M. Giannini.  Optimum design of open pit mines , 1991, Bulletin of the Australian Mathematical Society.

[21]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[22]  Dorit S. Hochbaum,et al.  Solving the Convex Cost Integer Dual Network Flow Problem , 1999, Manag. Sci..

[23]  M. Desu.  A Selection Problem , 1970 .

[24]  M. Balinski.  Notes—On a Selection Problem , 1970 .

[25]  J. M. Bremner,et al.  Statistical Inference under Restrictions , 1973 .

[26]  Robin O. Roundy,et al.  Optimal Machine Capacity Expansions with Nested Limitations Under Demand Uncertainty , 2002 .

[27]  Varghese S. Jacob,et al.  Prognosis Using an Isotonic Prediction Technique , 2004, Manag. Sci..

[28]  Robin O. Roundy,et al.  Optimal Machine Capacity Expansions with Nested Limitations under Stochastic Demand , 2004 .

[29]  Dorit S. Hochbaum,et al.  Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations , 2002, Eur. J. Oper. Res..

[30]  Alan J. Hoffman,et al.  SOME RECENT APPLICATIONS OF THE THEORY OF LINEAR INEQUALITIES TO EXTREMAL COMBINATORIAL ANALYSIS , 2003 .

[31]  Joseph Naor,et al.  Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality , 1994, SIAM J. Comput..

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

[33]  Dorit S. Hochbaum.  A new - old algorithm for minimum-cut and maximum-flow in closure graphs , 2001, Networks.

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

[35]  Eugene Levner,et al.  A network flow algorithm for just-in-time project scheduling , 1994 .

[36]  Dorit S. Hochbaum,et al.  Efficient Algorithms for the Inverse Spanning-Tree Problem , 2003, Oper. Res..

[37]  J. Picard.  Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .