Maximizing Distance in the Travelling Salesman Problem: Is it Possible?

  • Thread starter Thread starter sparsh12
  • Start date Start date
sparsh12
Messages
12
Reaction score
0
I change the question completely. If i get an answer for this, my question would be resolved.

Everyone is obsessive of finding minimum distance in Travelling Salesman Problem, but my question is,

"Is there a way to find the maximum distance possible?"

I know it is related to theory of computation, but i don't want to get into complication of computers.
 
Physics news on Phys.org
Hi, I don't know much about the TSP, but wonder in what way the problem of finding the maximum distance differs from that of finding the minimum.
 
I don't think it changes it at all. It's the same exact thing. Just invert the weights.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'

Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'

This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
View full post »

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Similar threads

Difficult to understand the solution provided in the video (travelling salesman problem)
Replies
3
Views
2K
Formulation of a linear programming model
Replies
1
Views
3K
Pulley Problem on an Inclined Surface Using Energy Methods
Replies
16
Views
1K
I Quintic Polynomial Tschirnhaus Transform: Possible complex Bring Radicals
Replies
0
Views
2K
I Need help understanding Commuting Operators
Replies
6
Views
2K
Shortest distance along the shore and into the lake
Replies
6
Views
911
Distance traveled by a Ball affected by friction after t seconds
Replies
4
Views
2K
B Graphing trip efficiency - distance over time
Replies
14
Views
2K
Irodov 1.23 confusion: Calculate distance traveled and time elapsed for this decelerating particle
Replies
2
Views
829
Distance traveled by a particle in a transverse wave
Replies
2
Views
3K

Hot Threads

Recent Insights

Back
Top