Jan Karel Lenstra - Böcker
Visar alla böcker från författaren Jan Karel Lenstra. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
Del 12 - Wiley Series in Discrete Mathematics & Optimization
Traveling Salesman Problem
A Guided Tour of Combinatorial Optimization
Inbunden, Engelska, 1985
5 127 kr
Skickas inom 7-10 vardagar
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.
2 891 kr
Skickas inom 7-10 vardagar
Covering deterministic scheduling, stochastic scheduling, and the probabilistic analysis of algorithms, this unusually broad view of the subject brings together tutorials, surveys and articles with original results from foremost international experts. The contributions reflect the great diversity in scheduling theory in terms of academic disciplines, applications areas, fundamental approaches and mathematical skills. This book will help researchers to be aware of the progress in the various areas of specialization and the possible influences that this progress may have on their own specialities. Few disciplines are driven so much by continually changing and expanding technology, a fact that gives scheduling a permanence while adding to the excitement of designing and analyzing new systems. The book will be a vital resource for researchers and graduate students of computer science, applied mathematics and operational research who wish to remain up-to-date on the scheduling models and problems of many of the newest technologies in industry, commerce, and the computer and communications sciences.
825 kr
Skickas inom 7-10 vardagar
In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Muhlenbein, Carsten Peterson, Bo Soderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L.Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Ostergard.
650 kr
Skickas inom 7-10 vardagar
The refereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems.