Introduction To Combinatorial Optimization (Springer Optimization And Its Applications, 196) - 9783031116841

Springer
SKU:
9783031116841
|
ISBN13:
9783031116841
$61.47
(No reviews yet)
Condition:
New
Usually Ships in 24hrs
Current Stock:
Estimated Delivery by: | Fastest delivery by:
Adding to cart… The item has been added
Buy ebook
Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.


  • | Author: Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
  • | Publisher: Springer
  • | Publication Date: Sep 28, 2023
  • | Number of Pages: 413 pages
  • | Language: English
  • | Binding: Paperback
  • | ISBN-10: 3031116844
  • | ISBN-13: 9783031116841
Author:
Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
Publisher:
Springer
Publication Date:
Sep 28, 2023
Number of pages:
413 pages
Language:
English
Binding:
Paperback
ISBN-10:
3031116844
ISBN-13:
9783031116841