Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized

DOI10.1016/j.endm.2009.11.023zbMath1268.05214OpenAlexW2058800323MaRDI QIDQ2840529

Alexandre Salles da Cunha, Cristiano Arbex Valle, Geraldo Robson Mateus, Leonardo Conegundes Martinez

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.023

zbMATH Keywords

combinatorial optimizationbranch-and-cutlocal branching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem

Cites Work

• Local branching
• A new variant of a vehicle routing problem: Lower and upper bounds
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

This page was built for publication: Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized