Problems and Solutions for Integer and Combinatorial Optimization
Building Skills in Discrete Optimization
Seiten
2024
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-1-61197-775-2 (ISBN)
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-1-61197-775-2 (ISBN)
The only book offering solved exercises for integer and combinatorial optimization, this contains 102 classroom tested problems of varying scope and difficulty chosen from a plethora of topics and applications. It has an associated website containing additional problems, miscellaneous material including suggested readings, and errata.
The only book offering solved exercises for integer and combinatorial optimization, this book contains 102 classroom tested problems of varying scope and difficulty chosen from a plethora of topics and applications. It has an associated website containing additional problems, miscellaneous material including suggested readings, and errata.
Topics covered include modeling capabilities of integer variables, the Branch-and-Bound method, cutting planes, network optimization models, shortest path problems, optimum tree problems, maximal cardinality matching problems, matching-covering duality, symmetric and asymmetric TSP, 2-matching and 1-tree relaxations, VRP formulations, and dynamic programming.
Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization is meant for undergraduate and beginning graduate students in mathematics, computer science, and engineering to use for self-study and for instructors to use in conjunction with other course material and when teaching courses in discrete optimization.
The only book offering solved exercises for integer and combinatorial optimization, this book contains 102 classroom tested problems of varying scope and difficulty chosen from a plethora of topics and applications. It has an associated website containing additional problems, miscellaneous material including suggested readings, and errata.
Topics covered include modeling capabilities of integer variables, the Branch-and-Bound method, cutting planes, network optimization models, shortest path problems, optimum tree problems, maximal cardinality matching problems, matching-covering duality, symmetric and asymmetric TSP, 2-matching and 1-tree relaxations, VRP formulations, and dynamic programming.
Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization is meant for undergraduate and beginning graduate students in mathematics, computer science, and engineering to use for self-study and for instructors to use in conjunction with other course material and when teaching courses in discrete optimization.
Mustafa Ç P?nar teaches and is an associate provost at Bilkent University. He was a Fulbright scholar at Princeton University and is area editor and associate editor for two international journals. Deniz Akkaya is pursuing his doctoral degree in industrial engineering from Bilkent University. He is the co-author of several papers on optimization.
Erscheinungsdatum | 03.01.2024 |
---|---|
Reihe/Serie | MOS-SIAM Series on Optimization ; 33 |
Verlagsort | New York |
Sprache | englisch |
Gewicht | 272 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik | |
ISBN-10 | 1-61197-775-4 / 1611977754 |
ISBN-13 | 978-1-61197-775-2 / 9781611977752 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren
Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90
Buch | Hardcover (2024)
Hanser (Verlag)
CHF 55,95