Local Search in Combinatorial Optimization (eBook)

Emile Aarts, Jan Karel Lenstra (Herausgeber)

eBook Download: PDF

2018
528 Seiten
Princeton University Press (Verlag)
978-0-691-18756-3 (ISBN)

Infos

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.

Autor

Emile Aarts is Vice-President and Scientific Program Director of the Philips Research Laboratories, Eindhoven, and a Professor of Computer Science at Eindhoven University of Technology. Jan Karel Lenstra is the John P. Hunter Chair and Professor of Industrial and Systems Engineering at the Georgia Institute of Technology.

Produkt-Details

• Erscheint lt. Verlag: 5.6.2018
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• Schlagworte: Abstraction (software engineering) • algorithm • Algorithm design • algorithmic • algorithmic efficiency • analysis of algorithms • approximation algorithm • Artificial Neural Network • assignment problem • autocorrelation • Bayesian inference • Best, worst and average case • Binary search algorithm • Cache algorithms • Calculation • Christofides algorithm • cluster analysis • combinatorial optimization • Computation • computational complexity theory • Computational Model • Computational problem • Computational resource • Constraint Satisfaction • Continuous Optimization • Convolutional code • covering problems • Decision problem • Decision Theory • Deterministic algorithm • Distance matrix • Dynamic Programming • estimation • evolutionary computation • expander graph • Feedback arc set • Function approximation • Genetic Algorithm • Gradient descent • greedy algorithm • Heuristic • Hirsch conjecture • hybrid algorithm • implementation • Instance (computer science) • Integer Programming • Iteration • Iterative Method • Job Shop Scheduling • Kruskal's Algorithm • linear code • Linear complementarity problem • Linear Programming • Linear programming relaxation • local optimum • Local search (optimization) • Log-space reduction • Loss Function • Matching (graph theory) • Mathematical Optimization • Metropolis–Hastings algorithm • Model of computation • Monte Carlo Method • Nearest neighbour algorithm • NP (complexity) • NP-hardness • Optimality criterion • optimization problem • Parallel Computing • Parameter (computer programming) • Partition problem • Polynomial-time approximation scheme • Polynomial-time reduction • Priority queue • Probabilistic method • Probability • Processing (programming language) • P versus NP problem • Quadratic Assignment Problem • Quadratic residue • randomized algorithm • Ranking (information retrieval) • Rate of Convergence • Ratio estimator • result • Scheduling (computing) • Search Algorithm • Search problem • Search tree • self-organizing map • Simplex Algorithm • sorting algorithm • Tabu Search • Theorem • time complexity • topological sorting • travelling salesman problem • Unification (computer science) • Variable (computer science) • Vehicle Routing Problem
• ISBN-10: 0-691-18756-8 / 0691187568
• ISBN-13: 978-0-691-18756-3 / 9780691187563