Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
From MaRDI portal
Publication:1622797
DOI10.1016/j.ejor.2018.08.034zbMath1403.90080OpenAlexW2888929375WikidataQ129318084 ScholiaQ129318084MaRDI QIDQ1622797
Juan-José Salazar-González, Tolga Bektaş, Antonio Martínez-Sykora, Luís Gouveia
Publication date: 19 November 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/424453/1/LBVRP.PDF
Related Items
Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
Uses Software
Cites Work
- Unnamed Item
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Polyhedral study of the capacitated vehicle routing problem
- Solution of large-scale symmetric travelling salesman problems
- Polyhedral results for a vehicle routing problem
- Multistars, partial multistars and the capacitated vehicle routing problem
- Separating capacity constraints in the CVRP using tabu search
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Polynomial-time separation of enhanced reverse multistar inequalities
- Multi-objective vehicle routing problems
- Projection results for vehicle routing
- On the symmetric travelling salesman problem I: Inequalities
- Multi-Terminal Network Flows
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
- Edmonds polytopes and weakly hamiltonian graphs
