علامة traveling-salesman - هذه الصفحة 31 - GeneraCodice

What is the optimal solution of the 1962 Procter and Gamble's TSP Contest?

https://www.generacodice.com/ar/articolo/1542920/what-is-the-optimal-solution-of-the-1962-procter-and-gamble-s-tsp-contest
  optimization  -  traveling-salesman
cs.stackexchange cs.stackexchange

How can TSP be an NP-optimization problem, when a feasible solution $s$ must be polynomial bounded in the instance size $|I|$?

https://www.generacodice.com/ar/articolo/1542757/how-can-tsp-be-an-np-optimization-problem-when-a-feasible-solution-s-must-be-polynomial-bounded-in-the-instance-size-i
  optimization  -  complexity-theory  -  traveling-salesman  -  np
cs.stackexchange cs.stackexchange

Minimum distance between start and end by going through must visit points in a maze

https://www.generacodice.com/ar/articolo/1516963/minimum-distance-between-start-and-end-by-going-through-must-visit-points-in-a-maze
  shortest-path  -  traveling-salesman  -  algorithms
cs.stackexchange cs.stackexchange

Advantage of MTZ problem formulation of TSP

https://www.generacodice.com/ar/articolo/1510633/advantage-of-mtz-problem-formulation-of-tsp
  linear-programming  -  traveling-salesman  -  algorithms  -  integer-programming
cs.stackexchange cs.stackexchange

What is the asymptotic runtime of the best known TSP solving algorithm?

https://www.generacodice.com/ar/articolo/1495893/what-is-the-asymptotic-runtime-of-the-best-known-tsp-solving-algorithm
  np-hard  -  traveling-salesman  -  algorithms
cs.stackexchange cs.stackexchange

Difference between BTSP and TSP [closed]

https://www.generacodice.com/ar/articolo/1494628/difference-between-btsp-and-tsp-closed
  traveling-salesman  -  algorithms
cs.stackexchange cs.stackexchange

Has it been proven that the optimization TSP is (or is not) polynomial-time verifiable if P ≠ NP?

https://www.generacodice.com/ar/articolo/1491068/has-it-been-proven-that-the-optimization-tsp-is-or-is-not-polynomial-time-verifiable-if-p-np
  optimization  -  complexity-theory  -  traveling-salesman  -  np
cs.stackexchange cs.stackexchange

How does the 3-opt algorithm for TSP work?

https://www.generacodice.com/ar/articolo/1490648/how-does-the-3-opt-algorithm-for-tsp-work
  optimization  -  heuristics  -  traveling-salesman  -  algorithms
cs.stackexchange cs.stackexchange

Algorithm to use for a TSP variant

https://www.generacodice.com/ar/articolo/1489518/algorithm-to-use-for-a-tsp-variant
  heuristics  -  traveling-salesman  -  algorithms  -  graphs
cs.stackexchange cs.stackexchange

Can Euclidean TSP be exactly solved in time better than (sym)metric TSP?

https://www.generacodice.com/ar/articolo/1488854/can-euclidean-tsp-be-exactly-solved-in-time-better-than-sym-metric-tsp
  np-hard  -  time-complexity  -  traveling-salesman  -  reference-request  -  graphs
cs.stackexchange cs.stackexchange
العثور على نتائج: 390
scroll top