Inbunden, Engelska, 1991
Del 12 i serien Wiley Series in Discrete Mathematics & Optimization
Traveling Salesman Problem
A Guided Tour of Combinatorial Optimization
Av E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys
7379 kr
Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Beskrivning
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.
Produktinformation
- Utgivningsdatum: 1991-01-15
- Mått: 170 x 247 x 32 mm
- Vikt: 879 g
- Format: Inbunden
- Språk: Engelska
- Serie: Wiley Series in Discrete Mathematics & Optimization
- Antal sidor: 476
- Förlag: John Wiley & Sons Inc
- ISBN: 9780471904137
Utforska kategorier
Mer information
Eugene Leighton Lawler was an American computer scientist, a professor of computer science at the University of California, Berkeley. Jan Karel Lenstra is the author of The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, published by Wiley.
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.