Submodular Functions and Optimization

It has been recognized that it has been successfully solved in the effective combinatorial optimization problems. Fascination, development, algorithmic economics, and algorithmic engineering, algorithmic economics submodular functions. "Submodular Function Minimization" and "Discrete Convex Analysis." The present 2nd edition is still a unique book on combinatorial optimization, discrete mathematics, and discrete algorithms in fields of mathematics, operations research, computer science, and economics.

Key features:

- Self-contained exposition of the theory of submodular functions.

- Selected up-to-date materials

- Polyhedral description of Discrete Convex Analysis.

- Full description of submodular function minimization algorithms.

- Effective insertion of figures.

- Useful in applied mathematics, operations research, computer science, and economics.

- Self-contained exposition of the theory of submodular functions.
- Selected up-to-date materials
- Polyhedral description of Discrete Convex Analysis.
- Full description of submodular function minimization algorithms.
- Effective insertion of figures.
- Useful in applied mathematics, operations research, computer science, and economics.

Preface.
Preface to the Second Editor.
Part I.
Chapter I. Introduction.
Chapter II. Submodular Systems and Base Polyhedra.
Chapter III. Neoflows.
Chapter IV. Submodular Analysis.
Chapter V. Nonlinear Optimizaation with Submodular Constraints.
Part II.
Chapter VI. Submodular Function Minimization.
Chapter VII. Discrete Convex Analysis.
References.
Index.