Login / Signup
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
Irina Dumitrescu
Stefan Ropke
Jean-François Cordeau
Gilbert Laporte
Published in:
Math. Program. (2010)
Keyphrases
</>
traveling salesman problem
combinatorial optimization
dynamic programming
ant colony optimization
hamiltonian cycle
search space
convex hull
cost function
simulated annealing
discrete particle swarm optimization
neural network
np hard
particle swarm optimization
global optimization
beam search