Selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today

Management Science

Volumn 50, Issue 6, 2004, Pages 709-723

  Hochbaum, Dorit S ^a  

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

Author keywords

Financial risk; Medical prognosis; Minimum cost flow; Parametric cut

Indexed keywords

FINANCIAL RISKS; MEDICAL PROGNOSIS; MINIMUM-COST FLOW; PARAMETRIC CUT;

ALGORITHMS; APPROXIMATION THEORY; COSTS; FINANCE; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; RISK ASSESSMENT;

MANAGEMENT SCIENCE;

EID: 3142563158     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.1040.0242     Document Type: Article

References (40)

1. Ahuja, R. K., J. B. Orlin. 2001. A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Oper. Res. 49(5) 784-789.
2. Ahuja, R. K., D. S. Hochbaum, J. B. Orlin. 2003. Solving the convex cost integer dual network flow problem. Management Sci. 49(7) 950-364.
3. Ahuja, R. K., D. S. Hochbaum, J. B. Orlin. 2004. A cut based algorithm for the convex dual of the minimum cost network flow problem. Algorithmica. Forthcoming.
4. Altman, E. I. 1968. Financial ratios, discriminant analysis and the prediction of corporate bankruptcy. J. Finance 23 589-609.
5. Balinski, M. L. 1970. On a selection problem, Management Sci. 17(3) 230-231.
6. Ball, M. 1992. Locating competitive new facilities in the presence of existing facilities. Proc. 5th United States Postal Service Adv. Tech. Conf., 1169-1177.
7. Barlow, R. E., D. J. Bartholomew, J. M. Bremer, H. D. Brunk. 1972. Statistical Inference Under Order Restrictions. Wiley, New York.
8. Çakaniyildirim, M., R. O. Roundy, S. C. Wood. 2004. Optimal machine capacity expansions with nested limitations under demand uncertainty. Naval Res. Logist. Forthcoming.
9. Gale, D. 1957. A theorem of flows in networks. Pacific J. Math. 7 1073-1082.
10. Gallo, G., M. D. Grigoriadis, R. E. Tarjan. 1989. A fast parametric maximum flow algorithm and applications. SIAM. J. Comput. 18(1) 30-55.
11. Goldberg, A. V., R. E. Tarjan. 1988. A new approach to the maximum flow problem. J. ACM 35 921-940.
12. Hochbaum, D. S. 1994. Lower and upper bounds for allocation problems. Math. Oper. Res. 19(2) 390-409.
13. Hochbaum, D. S. 1997a. Approximation Algorithms for NP-Hard Problems. PWS, Boston, MA.
14. Hochbaum, D. S. 1997b. The pseudoflow algorithm for the maximum flow problem. Manuscript revised 2002, University of California, Berkeley, CA.
15. Hochbaum, D. S. 2001a. A new-old algorithm for minimum-cut and maximum-flow in closure graphs. 30th Anniversary Special Paper. Networks 37(4) 171-193.
16. Hochbaum, D. S. 2001b. An efficient algorithm for image segmentation, Markov random fields and related problems. J. ACM 48(4) 686-701.
17. Hochbaum, D. S. 2002. Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. Eur. J. Oper. Res. 140(2) 291-321.
18. Hochbaum, D. S. 2003. Efficient algorithms for the inverse spanning tree problem. Oper. Res. 51(5) 785-797.
19. Hochbaum, D. S., J. Naor. 1994. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM J. Comput. 23(6) 1179-1192.
20. Hochbaum, D. S., A. Pathria. 1997. Forest harvesting and minimum cuts. Forest Sci. 43(4) 544-554.
21. Hochbaum, D. S., M. Queyranne. 2003. The convex cost closure problem. SIAM J. Discrete Math. 16(2) 192-207.
22. Hochbaum, D. S., J. G. Shanthikumar. 1990. Convex separable optimization is not much harder than linear optimization. J. ACM 37 843-862.
23. Hochbaum, D. S., N. Megiddo, J. Naor, A. Tamir. 1993. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming 62 69-83.
24. Hoffman, A. J. 1960. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. R. Bellman, M. Hall Jr., eds. Proc. Sympos. Appl. Math. Vol. X. Combinatorial Anal., American Mathematical Society, Providence, RI, 113-127.
25. Huh, W. T., R. O. Roundy. 2002. A continuous-time strategic capacity planning model. Working paper, Cornell University, Ithaca, NY.
26. Johnson, T. B. 1968. Optimum open pit mine production scheduling. Ph.D. thesis, Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA.
27. Karp, R. M. 1972. Reducibility among combinatorial problems. R. E. Miller, J. W. Tatcher, eds. Complexity of Computer Computations. Plenum Press, NY, 85-103.
28. Lawler, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
29. Legault, J. 1987. C.A. - Score, a warning system for small business failures Bilanas. Insolvency Prediction. E. Sands & Associates, Inc., www.sands-trustee.com/insolart.htm.
30. Lerchs, H., I. F. Grossmann. 1965. Optimum design of open-pit mines. Transactions, C.I.M. LXVIII 17-24.
31. Levner, E. V., A. S. Nemirovsky. 1991. A network flow algorithm for just-in-time project scheduling. Memorandum COSOR 91-21, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
32. Mamer, J. W., S. Smith. 1982. Optimizing field repair kits based on job completion rate. Management Sci. 28(11) 1328-1333.
33. Maxwell, W. L., J. A Muckstadt. 1985. Establishing consistent and realistic reorder intervals in production/distribution systems. Oper. Res. 33(6) 1316-1341.
34. Picard, J. C. 1976. Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22 1268-1272.
35. Radzik, T. 1993. Parametric flows, weighted means of cuts, and fractional combinatorial optimization. P. M. Pardalos, ed. Complexity in Numerical Optimization. World Scientific, Singapore, 351-386.
36. Rhys, J. M. W. 1970. A selection problem of shared fixed costs and network flows. Management Sci. 17(3) 200-207.
37. Roundy, R. 1985. A 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Sci. 31 1416-1430.
38. Ryu, Y. U., R. Chandrasekaran, V. Jacob. 2004. Disease prognosis with an isotonic prediction technique. Management Sci. 50(6) 777-785.
39. Veinott, A. F., Jr. 1971. Least d-majorized network flows with inventory and statistical applications. Management Sci. 17 547-567.
40. Zhang, F., R. O. Roundy, M. Çakanyildirim, W. T. Huh. 2004. Optimal capacity expansion for multi-product, multi-machine manufacturing systems with stochastic demand. IIE Trans. 36 23-36.