Bottleneck traveling salesman problem
The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. The problem is to find the Hamiltonian cycle (visiting each node exactly once) in a weighted graph which minimizes the weight of the highest-weight edge of the cycle. It was first formulated by with some additional constraints, and in its full generality by .
Link from a Wikipage to another Wikipage
primaryTopic
Bottleneck traveling salesman problem
The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. The problem is to find the Hamiltonian cycle (visiting each node exactly once) in a weighted graph which minimizes the weight of the highest-weight edge of the cycle. It was first formulated by with some additional constraints, and in its full generality by .
has abstract
The Bottleneck traveling sales ...... nd in its full generality by .
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,013,929,442
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
The Bottleneck traveling sales ...... nd in its full generality by .
@en
label
Bottleneck traveling salesman problem
@en