TSP problem solving with linear programming

Question

1.00/5 (3 votes)

See more:

Hi, a while ago I made a program that solves the traveling salesman problem using only linear programming. I would like to know a program that solves it using linear programming as well. The purpose is to compare its efficiency. For cases with a size of n=20, my program has taken between 30 seconds and several minutes to solve, depending on the case (using a traditional computer and programmed in C+).
Greetings!

What I have tried:

To calculate the execution time of my algorithm depends on each case. For the same input size, the execution time is different. That's why I want to know exactly that information.

Posted 16-Jul-24 20:10pm

Juan Carlos Arburua

Updated 16-Jul-24 21:53pm

Add a Solution

Comments

Richard Deeming 17-Jul-24 4:26am

Nice try, but nobody here is going to do your homework for you. Claiming that you've already done it, and you want to see a different solution "for comparison", isn't going to fool anyone.

CPallini 17-Jul-24 7:24am

:-)

Juan Carlos Arburua 17-Jul-24 15:15pm

It was a misunderstanding, I clarify that my idea was not to ask for a program. I expressed myself incorrectly: the question itself is to know which is the O(n) of the program that most quickly solves the TSP problem exactly without using dynamic programming. I found several articles but most were done with heuristics or dynamic programming.
Thank you.

Patrice T 18-Jul-24 6:25am

Use Improve question to update your question.
So that everyone can pay attention to this information.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Greg Utas · Answer 1 · 2024-07-22T12:48:00

Solution 2

The TSP is NP-complete and therefore requires exponential time as far as anyone knows. If an algorithm seems to perform better, it is likely because of the specific graph involved.

Posted 22-Jul-24 12:48pm

Greg Utas

OriginalGriff · Answer 2 · 2024-07-16T23:11:00

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]