Exact algorithms for a selective vehicle routing problem where the longest route is minimized

DOI10.1016/J.ENDM.2009.11.023MaRDI QIDQ2840529zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Heuristic and exact algorithms for a min-max selective vehicle routing problem
• On the vehicle routing problem
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Models, relaxations and exact approaches for the capacitated vehicle routing problem

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• 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
• Local branching

Cited in

(2)

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

This page was built for publication: Exact algorithms for a selective vehicle routing problem where the longest route is minimized

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