Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms*
暂无分享,去创建一个
[1] Thomas L. Magnanti,et al. Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..
[2] Laurence A. Wolsey,et al. Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem , 1980, Oper. Res..
[3] Laurence A. Wolsey,et al. A Canonical Representation of Simple Plant Location Problems and Its Applications , 1980, SIAM J. Matrix Anal. Appl..
[4] George L. Nemhauser,et al. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .
[5] A. Land,et al. Computer Codes for Problems of Integer Programming , 1979 .
[6] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[7] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[8] L. Kaufman,et al. An algorithm for the quadratic assignment problem using Bender's decomposition , 1978 .
[9] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .
[10] M. Guignard,et al. Algorithms for Exploiting the Structure of the Simple Plant Location Problem , 1977 .
[11] Arthur M. Geoffrion. How Can Specialized Discrete and Convex Optimization Methods Be Married , 1977 .
[12] F. Glover. IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .
[13] H. P. Williams. Experiments in the formulation of integer programming problems , 1974 .
[14] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[15] Kurt Spielberg,et al. Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..
[16] E. Lawler. The Quadratic Assignment Problem , 1963 .
[17] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .