New path elimination constraints for multi-depot routing problems

DOI10.1002/NET.21760WikidataQ58169418 ScholiaQ58169418MaRDI QIDQ6496355

Tolga Bektaş, Daniel Santos, Luís Gouveia

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

traveling salesmaninteger linear programmingseparationbranch-and-cutreformulationmulti-depot routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal capacitated ring trees
• Multi-depot multiple TSP: a polyhedral study and computational results
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Hamiltonian location problems
• A compact model and tight bounds for a combined location-routing problem
• Multi-depot rural postman problems
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

This page was built for publication: New path elimination constraints for multi-depot routing problems