Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
2. Submodular Systems and Base Polyhedra
4. Submodular Analysis
5. Nonlinear Optimizaation with Submodular Constraints
6. Submodular Function Minimization
7. Discrete Convex Analysis
It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing further increasing importance in optimization, combinatorics, discrete mathematics, algorithmic computer science, and algorithmic economics, and there have been made remarkable developments of theory and algorithms in submodular functions. The 2nd edition of the book supplements the 1st edition with a lot of remarks and with new two chapters: "Submodular Function Minimization" and "Discrete Convex Analysis." The present 2nd edition is still a unique book on submodular functions, which is essential to students and researchers interested in combinatorial optimization, discrete mathematics, and discrete algorithms in the fields of mathematics, operations research, computer science, and economics.
- Self-contained exposition of the theory of submodular functions
- Selected up-to-date materials substantial to future developments
- 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
(Graduate) students of Mathematics and Computer Science, (graduate) students of economics and operations research
- No. of pages:
- © Elsevier Science 2005
- 26th July 2005
- Elsevier Science
- Hardcover ISBN:
- eBook ISBN:
Research Institute for Mathematical Sciences, Kyoto University