python (65.1k questions)

javascript (44.2k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (12.9k questions)

Questions - traveling-salesman

Searching for a minimum cycle in a graph containing a set of nodes

If i have an undirected weighted graph G = (V, e) and a set of nodes P, how do i find the minimum cycle containing all the nodes in P? I have a large graph G and a set of nodes P based on user input. ...
test-img

Eric Eldridge

algorithm

graph

shortest-path

traveling-salesman

undirected-graph

Votes: 0

Answers: 2

Latest Answer

I can think of two propositions, one is based on a greedy algorithm that might give you a path and another that should give you the best path if one exists. Greedy solution Set the starting node p_st...
test-img

Tomer Geva

Reduce size of alternate solutions in optimization

We have a supplier/depot (index d) and several factories (index f) with demand known for different products (p) during T month (index t) ahead. There is a fleet of trucks (index v) with different truc...
test-img

Matt Najarian

mathematical-optimization

traveling-salesman

mixed-integer-programming

vehicle-routing

Votes: 0

Answers: 3

Latest Answer

Check out Cplex solution pool and how to set its filters.
test-img

Ayda Darvishan

Would an unordered_set in c++ find the values in this data in constant time?

Suppose I have a list of vertices in a graph. This list corresponds to a path in the graph and before adding another vertex I need to check if it is already present in the path or not. I was thinking ...
test-img

Paawan Angra

c++

traveling-salesman

Votes: 0

Answers: 1

Latest Answer

The std::unordered_set type has expected O(1) lookups regardless of what data you store in it, so yes, in this case you should expect to see lookups taking time O(1). One possible caveat: the O(1) her...
test-img

templatetypedef

Travelling Salesman with Momentum?

I have a task that is very similar to travelling salesman problem (TSP), but I'm not sure if it's easily mappable to TSP. I'm wondering if this variant has a name and known solvers already, or can be...
test-img

Peter

python

algorithm

graph

traveling-salesman

Votes: 0

Answers: 1

Latest Answer

TLDR: Here's a link to the code that solves it (or at least the example posted above). Explaination: Let's take funky-graph G with n nodes and tri-edges (i, j ,k). We will represent a set of edges as ...
test-img

zen-dev

Posts

Questions

Blogs

Jobs