๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

โœ Scribed by E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys

Publisher
Wiley
Year
1985
Tongue
English
Leaves
476
Series
Wiley Series in Discrete Mathematics & Optimization
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

The Traveling salesman problem : a guide
๐Ÿ“ The Traveling salesman problem : a guided tour of combinatorial optimization
โœ Lawler E.L., et al. (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1985 ๐Ÿ› Wiley ๐ŸŒ English

History / A.J. Hoffman, P. Wolfe -- Motivation and modeling / R.S. Garfinkel -- Computational complexity / D.S. Johnson, C.H. Papadimitriou -- Well-solved special cases / P.C. Gilmore, E.L. Lawler, D.B. Shmoys -- Performance guarantees for heuristics / D.S. Johnson, C.H. Papadimitriou -- Probabilis

Advances in Combinatorial Optimization:
๐Ÿ“ Advances in Combinatorial Optimization: Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems
โœ Moustapha Diaby, Mark H. Karwan ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› World Scientific Publishing Company ๐ŸŒ English

Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications

Advances in Combinatorial Optimization:
๐Ÿ“ Advances in Combinatorial Optimization: Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems
โœ Moustapha Diaby, Mark H. Karwan ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› World Scientific Publishing Company ๐ŸŒ English

Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications

Advances in Combinatorial Optimization:
๐Ÿ“ Advances in Combinatorial Optimization: Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems
โœ Moustapha Diaby, Mark H. Karwan ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› World Scientific Publishing Company ๐ŸŒ English

Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications

Aaaaaaaaand... Action!: The Optimal Solu
๐Ÿ“ Aaaaaaaaand... Action!: The Optimal Solution to the Travelling Salesman Problem, and a Theory of Everything
โœ Ariel Jacobs ๐Ÿ“‚ Library ๐Ÿ“… 2018 ๐ŸŒ English

Liberated from https://drive.google.com/file/d/1iE1BREHnZ2Tfpkt39AdvpvsQm2c7eBmy/view on Jan 23rd, 2019. --- Type PDF Size 9 MB (9,589,990 bytes) Storage used 0 bytesOwned by undefined Location My Drive Owner Ariel Jacobs Modified Sep 17, 2018 by Ariel Jacobs Opened 12:52 PM by me