Login / Signup
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand.
Nicola Bianchessi
Stefan Irnich
Christian Tilk
Published in:
Discret. Appl. Math. (2021)
Keyphrases
</>
preprocessing
learning algorithm
routing problem
dynamic programming
detection algorithm
cost function
linear programming
optimal solution
single source
k means
knapsack problem
expectation maximization
worst case
max min
path planning
simulated annealing
search space
computational complexity
objective function