Bottleneck Traveling Salesman Problem
The
Bottleneck traveling salesman problem
(bottleneck TSP) is a problem in
discrete
or
combinatorial optimization
. It is stated as follows: Find the
Hamiltonian cycle
in a
weighted graph
with the minimal length of the longest
edge
. The problem is known to be
NP-hard
.
Related topics
Traveling salesman problem
<< Previous
Word Browser
Next >>
guy hever
ralph hall
thomas grenville
book of judith
qubic
jcsp
ai lab
you don't know jack
han yu
aroup chatterjee
bai juyi
brodmann area 23
watkins' tower
inquiry education
liu zongyuan
francisco de miranda
anne de xainctonge
frontage road
national trunk highway system
harlow curtice
meng haoran
ma'adim vallis
international communist current
william pitt amherst, 1st earl amherst
li shangyin
frederick lanchester
javier snchez
duke of richmond
luca y el sexo
full motion video
stewart granger
james goldsmith
yungchen lhamo
eddie plank
professional american football championship games
j. meade falkner
neil bonnett
agence de coopration culturelle et technique
combinatorial optimization
edd roush
elsevier
beverley hughes
the secret of the old clock
fiona mactaggart
Copyright 2005-2009 OnPedia.com. All Rights Reserved