Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization » książka
Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization
ISBN-13: 9781611977752 / Angielski / Miękka / 2024 / 123 str.
Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization
ISBN-13: 9781611977752 / Angielski / Miękka / 2024 / 123 str.
(netto: 120,00 VAT: 5%)
Najniższa cena z 30 dni: 120,65
ok. 30 dni roboczych
Bez gwarancji dostawy przed świętami
Darmowa dostawa!
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.
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
