Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

This publication has 14 references indexed in Scilit:

• A Canonical Representation of Simple Plant Location Problems and Its Applications
  SIAM Journal on Algebraic Discrete Methods, 1980
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
  Operations Research, 1980
• Computer Codes for Problems of Integer Programming
  Annals of Discrete Mathematics, 1979
• An analysis of approximations for maximizing submodular set functions—I
  Mathematical Programming, 1978
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
  Mathematics of Operations Research, 1978
• An algorithm for the quadratic assignment problem using Bender's decomposition
  European Journal of Operational Research, 1978
• Multicommodity Distribution System Design by Benders Decomposition
  Management Science, 1974
• Experiments in the formulation of integer programming problems
  Published by Springer Nature ,1974
• Partitioning procedures for solving mixed-variables programming problems
  Numerische Mathematik, 1962
• Solution of a Large-Scale Traveling-Salesman Problem
  Journal of the Operations Research Society of America, 1954