Applications of Combinatorial Optimization

Other author Paschos, Vangelis Th. Editor
Format Electronic
Edition2nd ed.
Publication InfoWiley-ISTE [Imprint] Hoboken : John Wiley & Sons, Incorporated
Supplemental ContentFull text available from Ebook Central - Academic Complete
Subjects

Summary Annotation Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. "Concepts of Combinatorial Optimization," is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field."
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
ISBN9781119015246
ISBN1119015243 (E-Book) Active Record
Stock number00028608

Availability

Library Location Call Number Status Item Actions
Electronic Resources Access Content Online ✔ Available