Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Title
Introduction to combinatorial optimization / Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu.
ISBN
9783031105968 (electronic bk.)
3031105966 (electronic bk.)
9783031105944
303110594X
Publication Details
Cham : Springer, 2022.
Language
English
Description
1 online resource (407 p.).
Item Number
10.1007/978-3-031-10596-8 doi
Call Number
QA402.5
Dewey Decimal Classification
519.6/4
Summary
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.
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed October 10, 2022).
Series
Springer optimization and its applications ; v. 196.
