Transformations of node-balanced routing problems

DOI10.1002/NAV.21634MaRDI QIDQ4632892zbMATH OpenOpenAlexFDO

Authors Antonio Martínez-Sykora, Tolga Bektaş

Publication date 2 May 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/377855/1/SB_Transf_v2.pdf

zbMATH Keywords

traveling salesman problemvehicle routing problemsbalancing constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• A compact transformation of arc routing problems into node routing problems
• Transforming arc routing into node routing problems
• An efficient transformation of the generalized vehicle routing problem
• Exact methods based on node-routing formulations for undirected arc-routing problems

Cited in

(3)

• scientific article; zbMATH DE number 2016067 (Why is no real title available?)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations

This page was built for publication: Transformations of node-balanced routing problems

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