Results 131 to 140 of about 415 (166)

Separating capacity constraints in the CVRP using tabu search

European Journal of Operational Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Augerat, P.   +4 more
openaire   +2 more sources

Efficient PTAS for the Euclidean CVRP with Time Windows

2018
The Capacitated Vehicle Routing Problem (CVRP) is the well-known combinatorial optimization problem having a wide range of practical applications in operations research. It is known that the problem is NP-hard and remains intractable even in the Euclidean plane.
Michael Khachay, Yuri Ogorodnikov
openaire   +1 more source

Home - About - Disclaimer - Privacy