The traveling salesman problem and its variations combinatorial optimization paperback may 18 2007 by g gutin editor ap punnen editor 40 out of 5 stars 1 customer review see all 6 formats and editions hide other formats and editions price . The bottleneck traveling salesman problem bottleneck tsp is a problem in discrete or combinatorial optimization the problem is to find the hamiltonian cycle in a weighted graph which minimizes the weight of the most weighty edge of the cycle. Combinatorial optimization volume 12 through monographs and contributed works the objective of the series is to publish state of the art expository research covering all topics in the field of combinatorial optimization in xii the traveling salesman problem and its variations. The traveling salesman problem tsp is a widely studied combinatorial optimization problem which given a set of cities and a cost to travel from one city to another seeks to identify the tour that will allow a salesman to visit each city only once starting and ending in the same city at the minimum cost 1. The traveling salesman problem tsp i perhap s s the most well known combinatorial optimization problem the book the travehng sales man problem a guided tour of combinatorial optimization edited by lawler lenstra rinoo ka y n and shmoys provides the state of the art description of the topi u cp to 1985
How it works:
1. Register a Free 1 month Trial Account.
2. Download as many books as you like ( Personal use )
3. No Commitment. Cancel anytime.
4. Join Over 100.000 Happy Readers.
5. That's it. What you waiting for? Sign Up and Get Your Books.