HomeGroupsTalkZeitgeist
This site uses cookies to deliver our services, improve performance, for analytics, and (if not signed in) for advertising. By using LibraryThing you acknowledge that you have read and understand our Terms of Service and Privacy Policy. Your use of the site and services is subject to these policies and terms.
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Submodular Functions and Optimization,…
Loading...

Submodular Functions and Optimization, Volume 58, Second Edition: Second…

by Satoru Fujishige

MembersReviewsPopularityAverage ratingConversations
3None2,001,085NoneNone
Recently added byuhan

No tags.

None.

None
Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Publisher series
Original language

References to this work on external resources.

Wikipedia in English (4)

Book description
Haiku summary

Amazon.com Product Description (ISBN 0444885560, Hardcover)

The importance of submodular functions has been widely recognized in recent years in combinatorial optimization. This is the first book devoted to the exposition of the theory of submodular functions from an elementary technical level to an advanced one. A unifying view of the theory is shown by means of base polyhedra and duality for submodular and supermodular systems. Among the subjects treated are: neoflows (submodular flows, independent flows, polymatroidal flows), submodular analysis (submodular programs, duality, Lagrangian functions, principal partitions), nonlinear optimization with submodular constraints (lexicographically optimal bases, fair resource allocation). Special emphasis is placed on the constructive aspects of the theory, which lead to practical, efficient algorithms.

(retrieved from Amazon Thu, 12 Mar 2015 18:10:48 -0400)

(see all 2 descriptions)

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. - 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.… (more)

Quick Links

Popular covers

Rating

Average: No ratings.

Is this you?

Become a LibraryThing Author.

 

About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 126,371,790 books! | Top bar: Always visible