Description: Product InformationCombinatorial 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
Price: 55 USD
Location: El Paso, Texas
End Time: 2024-11-20T18:20:19.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
All returns accepted: ReturnsNotAccepted
Book Title: Paradigms of Combinatorial Optimization : Problems and New Approa
Number of Pages: 720 Pages
Language: English
Publication Name: Paradigms of Combinatorial Optimization : Problems and New Approaches
Publisher: Wiley & Sons, Incorporated, John
Subject: Game Theory, General, Combinatorics
Publication Year: 2014
Item Height: 2 in
Item Weight: 47.4 Oz
Type: Textbook
Subject Area: Mathematics
Author: Vangelis Th. Paschos
Item Length: 9.5 in
Item Width: 6.5 in
Format: Hardcover
