Re: [eclipse-clp-users] How to find a route between a collection of nodes in a graph?

From: Joachim Schimpf <jschimpf_at_...311...>
Date: Wed, 13 Feb 2013 12:09:18 +0000
On 13/02/2013 10:49, Marco Gavanelli wrote:
> Dear Hadeer,
>
> your problem looks like a variation of the Hamiltonian Circuit in which
> you have different starting and ending nodes.
>
> Here you can find a solution to the Tavelling Salesperson Problem, which
> is the Hamiltonian circuit with a minimization of the travelled distance:
>
> http://eclipseclp.org/archive/eclipse-users/0471.html
>
> You might take inspiration from this solution.

Another possibility is the cycle-constraint in ECLiPSe 6.1,
which was contributed by Lukasz Domagala

http://www.eclipseclp.org/docs/Dev/current/bips/lib_public/cycle/index.html


-- Joachim
Received on Wed Feb 13 2013 - 12:09:36 CET

This archive was generated by hypermail 2.2.0 : Mon Jul 09 2018 - 02:05:30 CEST