The Data-Correcting Algorithm for the Minimization of Supermodular Functions

References

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