Minimizing a convex cost closure set

SIAM Journal on Discrete Mathematics

Volumn 16, Issue 2, 2003, Pages 192-207

  Hochbaum, Dorit S ^a   Queyranne, Maurice ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Bayesian estimation; Closure problem; Convex Optimization; Maximum flow; Nonlinear costs; Parametric minimum cut

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; ESTIMATION; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; REGRESSION ANALYSIS;

BAYESIAN ESTIMATION; CLOSURE PROBLEM; CONVEX OPTIMIZATION; MAXIMUM FLOW;

SET THEORY;

EID: 0038476144     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100369584     Document Type: Article

References (24)

1. R. K. Ahuja and J. B. Orlin, A fast scaling algorithm for minimizing separable convex functions subject to chain constraints, Oper. Res., 49 (2001), pp. 784-789.
2. R. K. Ahuja, D. S. Hochbaum, and J. B. Orlin, A Cut Based Algorithm for the Convex Dual of the Minimum Cost Network Flow Problem, manuscript.
3. R. K. Ahuja, D. S. Hochbaum, and J. B. Orlin, Solving the convex cost integer dual network flow problem, Management Sci., to appear.
4. R. E. Barlow, D. J. Bartholomew, J. M. Bremer, and H. D. Brunk, Statistical Inference Under Order Restrictions, Wiley, New York, 1972.
5. M. De Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer-Verlag, Berlin, 1997.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1989.
7. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM J. Comput., 18 (1989), pp. 30-55.
8. A. V. Goldberg, and R. E. Tarjan, A new approach to the maximum flow problem, J. Assoc. Comput. Mach., 35 (1988), pp. 921-940.
9. D. S. Hochbaum, and J. Naor, Simple and fast algorithms for linear and integer programs with two variables per inequality, SIAM J. Comput., 23 (1994), pp. 1179-1192.
10. D. S. Hochbaum, and J. G. Shanthikumar, Convex separable optimization is not much harder than linear optimization, J. Assoc. Comput. Mach., 37 (1990), pp. 843-862.
11. D. S. Hochbaum, Lower and upper bounds for allocation problems, Math. Oper. Res., 19 (1994), pp. 390-409.
12. D. S. Hochbaum, Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations, European J. Oper. Res., 140 (2002), pp. 291-321.
13. D. S. Hochbaum, The Pseudoflow Algorithm for the Maximum Flow Problem, manuscript.
14. D. S. Hochbaum, Efficient algorithms for the inverse spanning tree problem, Oper. Res., to appear.
15. D. S. Hochbaum, An efficient algorithm for image segmentation, Markov random fields and related problems, J. Assoc. Comput. Mach., 48 (2001), pp. 686-701.
16. W. L. Maxwell and J. A. Muckstadt, Establishing consistent and realistic reorder intervals in production/distribution systems, Oper. Res., 33 (1985), pp. 1316-1341.
17. J. C. Picard, Maximal closure of a graph and applications to combinatorial problems, Management Sci., 22 (1976) pp. 1268-1272.
18. J.-C. Picard and M. Queyranne, Selected applications of minimum cuts in networks, INFOR - Canad. J. Oper. Res. Inform. Process., 20 (1982), pp. 394-422.
19. J. C. Picard and M. Queyranne, Integer Minimization of a Separable Convex Function Subject to Variable Upper Bound Constraints, manuscript.
20. R. Roundy, A 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems, Management Sci., 31 (1985) pp. 1416-1430.
21. M. I. Shamos and D. Hoey, Geometric intersection problems, in Proc. 17th Ann. Symp. on Foundations of Computer Science, IEEE, Long Beach, CA, 1976, pp. 208-215.
22. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
23. P. T. Sokkalingam, R. Ahuja, and J. B. Orlin, Solving inverse spanning tree problems through network flow techniques, Oper. Res., 47 (1999), pp. 291-298.
24. A. F. Veinott, Jr., Least d-majorized network flows with inventory and statistical applications, Management Sci., 17 (1971), pp. 547-567.