menu
{ "item_title" : "Applications of Combinatorial Optimization", "item_author" : [" Vangelis Th Paschos "], "item_description" : "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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/84/821/658/1848216580_b.jpg", "price_data" : { "retail_price" : "202.95", "online_price" : "202.95", "our_price" : "202.95", "club_price" : "202.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Applications of Combinatorial Optimization|Vangelis Th Paschos

Applications of Combinatorial Optimization

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781848216587
  • ISBN-10: 1848216580
  • Publisher: Wiley-Iste
  • Publish Date: September 2014
  • Dimensions: 9.3 x 6.2 x 1.2 inches
  • Shipping Weight: 1.75 pounds
  • Page Count: 448

Related Categories

You May Also Like...

    1

BAM Customer Reviews