Distance constrained vehicle routing problem to minimize the total cost

DOI10.1007/978-3-030-26176-4_53OpenAlexW2963249037MaRDI QIDQ2300077

Zhaohui Liu, Xiaoguang Bao, Wei Yu

Publication date: 24 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26176-4_53

zbMATH Keywords

vehicle routingapproximation algorithmintegrality gappath covercycle cover

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Computational Science – ICCS 2005

Recommendations

• Title not available (Why is that?) 👍 👎
• Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity 👍 👎
• The vehicle routing problem 👍 👎
• Solution of a min-max vehicle routing problem 👍 👎
• Approximation algorithms for distance constrained vehicle routing problems 👍 👎
• Two exact algorithms for the distance-constrained vehicle routing problem 👍 👎
• On the Distance Constrained Vehicle Routing Problem 👍 👎
• COST ALLOCATION ON VEHICLE ROUTING PROBLEM 👍 👎
• Computational Science – ICCS 2005 👍 👎

This page was built for publication: Distance constrained vehicle routing problem to minimize the total cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300077)