Submodular Functions and Optimization, Volume 58

2nd Edition

Authors: Satoru Fujishige
Hardcover ISBN: 9780444520869
eBook ISBN: 9780080461625
Imprint: Elsevier Science
Published Date: 26th July 2005
Page Count: 410
146.00 + applicable tax
89.00 + applicable tax
111.00 + applicable tax
133.00 + applicable tax
Unavailable
Compatible Not compatible
VitalSource PC, Mac, iPhone & iPad Amazon Kindle eReader
ePub & PDF Apple & PC desktop. Mobile devices (Apple & Android) Amazon Kindle eReader
Mobi Amazon Kindle eReader Anything else

Institutional Access


Table of Contents

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..

Description

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.

Key features:

  • 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.

Key Features

  • 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.

Readership

(Graduate) students of Mathematics and Computer Science, (graduate) students of economics and operations research.


Details

No. of pages:
410
Language:
English
Copyright:
© Elsevier Science 2005
Published:
Imprint:
Elsevier Science
eBook ISBN:
9780080461625
Hardcover ISBN:
9780444520869

Reviews

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.

Key features:

- 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.


About the Authors

Satoru Fujishige Author

Affiliations and Expertise

Research Institute for Mathematical Sciences, Kyoto University