Sequencing of insertions in printed circuit board assembly
Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing in Science and Engineering
Approximation algorithms for NMR spectral peak assignment
Theoretical Computer Science
Automated Protein NMR Resonance Assignments
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Simple Algorithms for Gilmore–Gomory's Traveling Salesman and Related Problems
Journal of Scheduling
A random graph approach to NMR sequential assignment
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Four point conditions and exponential neighborhoods for symmetric TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
8/7-approximation algorithm for (1,2)-TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On Gilmore-Gomory's open question for the bottleneck TSP
Operations Research Letters
Complexity analysis of balloon drawing for rooted trees
Theoretical Computer Science
Experimental analysis of heuristics for the bottleneck traveling salesman problem
Journal of Heuristics
A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.00 |
Consider a truck running along a road. It picks up a load L"i at point @b"i and delivers it at @a"i, carrying at most one load at a time. The speed on the various parts of the road in one direction is given by f(x) and that in the other direction is given by g(x). Minimizing the total time spent to deliver loads L"1,...,L"n is equivalent to solving the traveling salesman problem (TSP) where the cities correspond to the loads L"i with coordinates (@a"i,@b"i) and the distance from L"i to L"j is given by @!"@a"""i^@b^"^jf(x)dx if @b"j=@a"i and by @!"@b"""j^@a^"^ig(x)dx if @b"j=f(x)g(x)=1@c@?x. Note that when f(x)=g(x), the approximation ratio is 3.