Data-correcting algorithm for the minimization of supermodular functions

Management Science

Volumn 45, Issue 11, 1999, Pages 1539-1551

  Goldengorin, Boris ^a   Sierksma, Gerard ^a   Tijssen, Gert A ^a   Tso, Michael ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COSTS; HEURISTIC METHODS; POLYNOMIALS; SITE SELECTION;

BRANCH-AND-BOUND TYPE ALGORITHMS; DATA-CORRECTING (DC) ALGORITHMS; SUPERMODULAR FUNCTIONS;

RISK MANAGEMENT;

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

References (22)

1. Babayev, Dj. A. 1974. Comments on the note of Frieze. Math. Programming 7 249-252.
2. Barahona, F., M. Grötschel, M. Jūnger, G. Reinelt. 1988. An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3) 493-512.
3. Beasley, J. E. 1993. Lagrangean heuristics for location problems. European J. Oper. Res. 65 383-399.
4. Boffey, T. B. 1982. Graph Theory in Operations Research. Academic Press, London, U.K.
5. Cherenin, V. P. 1962. Solving some combinatorial problems of optimal planning by the method of successive calculations. Proc. Conf. Experiences and Perspectives of the Appl. Math. Methods and Electronic Comput. Planning. Mimeograph, (in Russian) Novosibirsk, Russia.
6. Genkin, A. V., I. B. Muchnik. 1990. Optimum algorithm for maximization of submodular functions. Automation and Remote Control USSR 51 1121-1128.
7. Goldengorin, B. 1982. On the stability of solutions in problems with a single connected component of local minima. Models and Methods of Solving Problems of Economic Systems Interaction. (in Russian) Nauka, Novosibirsk 149-160.
8. _. 1983. A correcting algorithm for solving some discrete optimization problems. Soviet Math. Doklady 27 620-623.
9. _. 1995. Requirements of Standards: Optimization Models and Algorithms. Russian Operations Research, Hoogezand, The Netherlands.
10. Grimaldi, R. P. 1994. Discrete and Combinatorial Mathematics: An Applied Introduction, 3rd ed. Addison-Wesley Publishing Company, New York.
11. Khachaturov, V. R. 1968. Some problems of the successive calculation method and its applications to location problems. (In Russian) Ph.D Thesis, Central Economics & Mathematics Institute, Russian Academy of Sciences, Moscow, Russia.
12. Ko, C.-W., J. Lee, M. Queyranne. 1995. An exact algorithm for maximum entropy sampling. Oper. Res. 43 684-691.
13. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. Shmoys, eds. 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, U.K.
14. Lee, J. 1998. Constrained maximum-entropy sampling. Oper. Res. 46 655-664.
15. Lee, H., G. L. Nemhauser, Y. Wang. 1996. Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case. European J. Oper. Res. 94 154-166.
16. Lovasz, L. 1983. Submodular functions and convexity. A. Bachem, M. Grötschel, B. Korte, eds. Mathematical Programming: The State of the Art. Springer-Verlag, Berlin, Germany. 235-257.
17. Minoux, M. 1977. Accelerated greedy algorithms for maximizing submodular set functions. Actes Congres IFIP. J. Stoer, ed. Springer Verlag, Berlin, Germany. 234-243.
18. Nemhauser, G. L., L. A. Wolsey. 1981. Maximization submodular set functions: formulations and analysis of algorithms. P. Hansen, ed. Studies on Graphs and Discrete Programming. North-Holland Publishing, Amsterdam, The Netherlands 279-301.
19. _, _, M. L. Fisher. 1978. An analysis of approximations for maximizing submodular set functions-I. Math. Programming 14 265-294.
20. Nering, E. D., A. W. Tucker. 1993. Linear Programs and Related Problems. Academic Press, Inc., San Diego, CA.
21. Petrov, A., V. Cherenin. 1948. An improvement of train gathering plans design methods. (In Russian). Zheleznodorozhnyi Trans. 3 60-71.
22. Robertazzi, T. G., S. C. Schwartz. 1989. An accelerated sequential algorithm for producing D-optimal designs. SIAM J. Sci. Statist. Comput. 10 341-358.