Discrete Convex Analysis | Agenda Bookshop Skip to content
Selected Colleen Hoover Books at €9.99c | In-store & Online
Selected Colleen Hoover Books at €9.99c | In-store & Online
A01=Kazuo Murota
Age Group_Uncategorized
Age Group_Uncategorized
Author_Kazuo Murota
automatic-update
Category1=Non-Fiction
Category=PBD
Category=PBK
Category=PBW
COP=United States
Delivery_Delivery within 10-20 working days
Language_English
PA=Available
Price_€100 and above
PS=Active
softlaunch

Discrete Convex Analysis

English

By (author): Kazuo Murota

Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics.

This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis. See more
Current price €165.29
Original price €173.99
Save 5%
A01=Kazuo MurotaAge Group_UncategorizedAuthor_Kazuo Murotaautomatic-updateCategory1=Non-FictionCategory=PBDCategory=PBKCategory=PBWCOP=United StatesDelivery_Delivery within 10-20 working daysLanguage_EnglishPA=AvailablePrice_€100 and abovePS=Activesoftlaunch
Delivery/Collection within 10-20 working days
Product Details
  • Weight: 733g
  • Dimensions: 152 x 229mm
  • Publication Date: 30 Jul 2013
  • Publisher: Society for Industrial & Applied MathematicsU.S.
  • Publication City/Country: United States
  • Language: English
  • ISBN13: 9781611972559

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept