Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bottleneck_traveling_salesman_problem> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- Bottleneck_traveling_salesman_problem abstract "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 which minimizes the weight of the most weighty edge of the cycle.The problem is known to be NP-hard. The decision problem version of this, "for a given length x, is there a Hamiltonian cycle in a graph g with no edge longer than x?", is NP-complete.In an asymmetric bottleneck TSP, there are cases where the weight from node A to B is different from the weight from B to A (e. g. travel time between two cities with a traffic jam in one direction).Euclidean bottleneck TSP, or planar bottleneck TSP, is the bottleneck TSP with the distance being the ordinary Euclidean distance. The problem still remains NP-hard, however many heuristics work better.If the graph is a metric space then there is an efficient approximation algorithm that finds a Hamiltonian cycle with maximum edge weight being no more than twice the optimum.".
- Bottleneck_traveling_salesman_problem wikiPageID "420524".
- Bottleneck_traveling_salesman_problem wikiPageRevisionID "509363651".
- Bottleneck_traveling_salesman_problem hasPhotoCollection Bottleneck_traveling_salesman_problem.
- Bottleneck_traveling_salesman_problem subject Category:Combinatorial_optimization.
- Bottleneck_traveling_salesman_problem subject Category:Graph_algorithms.
- Bottleneck_traveling_salesman_problem subject Category:Hamiltonian_paths_and_cycles.
- Bottleneck_traveling_salesman_problem type Abstraction100002137.
- Bottleneck_traveling_salesman_problem type Act100030358.
- Bottleneck_traveling_salesman_problem type Action100037396.
- Bottleneck_traveling_salesman_problem type Activity100407535.
- Bottleneck_traveling_salesman_problem type Algorithm105847438.
- Bottleneck_traveling_salesman_problem type Course100038262.
- Bottleneck_traveling_salesman_problem type Event100029378.
- Bottleneck_traveling_salesman_problem type GraphAlgorithms.
- Bottleneck_traveling_salesman_problem type HamiltonianPathsAndCycles.
- Bottleneck_traveling_salesman_problem type Procedure101023820.
- Bottleneck_traveling_salesman_problem type PsychologicalFeature100023100.
- Bottleneck_traveling_salesman_problem type Rule105846932.
- Bottleneck_traveling_salesman_problem type Way100415676.
- Bottleneck_traveling_salesman_problem type YagoPermanentlyLocatedEntity.
- Bottleneck_traveling_salesman_problem comment "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 which minimizes the weight of the most weighty edge of the cycle.The problem is known to be NP-hard.".
- Bottleneck_traveling_salesman_problem label "Bottleneck traveling salesman problem".
- Bottleneck_traveling_salesman_problem sameAs m.026d5b.
- Bottleneck_traveling_salesman_problem sameAs Q4949085.
- Bottleneck_traveling_salesman_problem sameAs Q4949085.
- Bottleneck_traveling_salesman_problem sameAs Bottleneck_traveling_salesman_problem.
- Bottleneck_traveling_salesman_problem wasDerivedFrom Bottleneck_traveling_salesman_problem?oldid=509363651.
- Bottleneck_traveling_salesman_problem isPrimaryTopicOf Bottleneck_traveling_salesman_problem.