Hello,
Can anybody suggest (and describe) a simple relaxation to the
travelling salesman problem?
I'm only interested in solving small instances and intend to use a
branch-and-bound algorithm.
Regards,
--markus
--~--~-~--~~~---~--~~
You received this message
Hi,
I´m trying to write some code in order to find a good approximation to
the solution of a Capacitated Vehicle Routing Problem (similar to the
Multiple Traveling Salesman Problem). I am aware that´s an NP-hard
problem.
The objective of the CVRP is to deliver a set of customers with known
