Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
type: Item
instance of: scholarly article
title: Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
zbMATH Open document ID: 1242.90186
author: Tolga Bektaş
published in: European Journal of Operational Research
publication date: 2012-05-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6035124
zbMATH Keywords: fixed destination
zbMATH Keywords: multiple traveling salesman problem
zbMATH Keywords: Benders decomposition
zbMATH Keywords: multicommodity network design
cites work: VRP
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: A note on the selection of Benders' cuts
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: The balanced billing cycle vehicle routing problem
cites work: The traveling salesman problem and its variations.
cites work: Multi-objective vehicle routing problems
cites work: Integer linear programming formulations of multiple salesman problems and its variations
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Q3217886
cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
cites work: Q3677509
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: A comparative analysis of several asymmetric traveling salesman problem formulations
cites work: Practical enhancements to the Magnanti-Wong method
cites work: The vehicle routing problem
describes a project that uses: VRP
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.07.020
OpenAlex ID: W1965038839
DOI: 10.1016/J.EJOR.2011.07.020
description: scientific article; zbMATH DE number 6035124