Introduction to Combinatorial Optimization
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 autho...
Main Authors: | , , , |
---|---|
Format: | eBook |
Language: | English |
Published: |
Cham
Springer International Publishing
2022, 2022
|
Edition: | 1st ed. 2022 |
Series: | Springer Optimization and Its Applications
|
Subjects: | |
Online Access: | |
Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- 1. Introduction.-2. Divide-and-Conquer
- 3. Dynamic Programming and Shortest Path
- 4. Greedy Algorithm and Spanning Tree
- 5. Incremental Method and Maximum Network Flow
- 6. Linear Programming
- 7. Primal-Dual Methods and Minimum Cost Flow
- 8. NP-hard Problems and Approximation Algorithms
- 9. Restriction and Steiner Tree
- 10. Greedy Approximation and Submodular Optimization
- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization
- Bibliography