Cantitate/Preț
Produs

A First Course in Combinatorial Optimization: Cambridge Texts in Applied Mathematics, cartea 36

Autor Jon Lee
en Limba Engleză Paperback – 8 feb 2004
A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 37157 lei  6-8 săpt.
  Cambridge University Press – 8 feb 2004 37157 lei  6-8 săpt.
Hardback (1) 55745 lei  6-8 săpt.
  Cambridge University Press – 8 feb 2004 55745 lei  6-8 săpt.

Din seria Cambridge Texts in Applied Mathematics

Preț: 37157 lei

Nou

Puncte Express: 557

Preț estimativ în valută:
7111 7480$ 5933£

Carte tipărită la comandă

Livrare economică 09-23 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521010122
ISBN-10: 0521010128
Pagini: 228
Dimensiuni: 152 x 229 x 17 mm
Greutate: 0.32 kg
Ediția:New.
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Texts in Applied Mathematics

Locul publicării:New York, United States

Cuprins

Introduction; Polytopes and linear programming; 1. Matroids and the greedy algorithm; 2. Minimum-weight dipaths; 3. Matroid intersection; 4. Matching; 5. Flows and cuts; 6. Cutting planes; 7. Branch-&-bound; 8. Optimizing submodular functions; Appendix.

Recenzii

'The author, with his light but rigorous mathematical writing style, takes delight in revealing the stars of combinatorial optimization. This is an excellent teaching book; I recommend it highly.' International Statistical Institute

Descriere

This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.