Maximization of submodular functions: Theory and enumeration algorithms

@article{Goldengorin2009MaximizationOS,
  title={Maximization of submodular functions: Theory and enumeration algorithms},
  author={Boris Goldengorin},
  journal={European Journal of Operational Research},
  year={2009},
  volume={198},
  pages={102-112}
}
Submodular functions are powerful tools to model and solve either to optimality or approximately many operational research problems including problems defined on graphs. After reviewing some long-standing theoretical results about the structure of local and global maxima of submodular functions, Cherenin's selection rules and his Dichotomy Algorithm, we revise the above mentioned theory and show that our revision is useful for creating new non-binary branching algorithms and finding either… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 40 REFERENCES

Some Problems of the Successive Calculation Method and its Applications to Location Problems

V. R. Khachaturov
  • Ph.D. Thesis, Central Economics & Mathematics Institute, Russian Academy of Sciences,
  • 1968
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

A correcting algorithm for solving some discrete optimization problems

B. I. Goldengorin
  • Soviet Mathematical Doklady 27
  • 1983
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A cost function property for plant location problems

  • Math. Program.
  • 1974
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Comments on the note of Frieze

  • Math. Program.
  • 1974
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

On the Set-Covering Problem

  • Operations Research
  • 1972
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL