A TSSP+1 decomposition strategy for the vehicle routing problem
type: Item
instance of: scholarly article
title: A TSSP+1 decomposition strategy for the vehicle routing problem
zbMATH Open document ID: 0813.90038
DOI: 10.1016/0377-2217(94)90063-9
author: Charles E. Noon
author: Rekha Pillai
author: John Mittenthal
published in: European Journal of Operational Research
publication date: 1995-01-12T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 710950
zbMATH Keywords: capacity-constrained vehicle routing
zbMATH Keywords: decomposition strategy
zbMATH Keywords: traveling salesman subset-tour problem
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: set partitioning
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90063-9
OpenAlex ID: W2093657312
cites work: A set‐partitioning‐based exact algorithm for the vehicle routing problem
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Q4205235
cites work: An Integer Programming Approach to the Vehicle Scheduling Problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: The orienteering problem
cites work: Implementing vehicle routing algorithms
cites work: A generalized exchange heuristic for the capacitated vehicle routing problem
cites work: Algorithms to solve the orienteering problem: A comparison
cites work: The selective travelling salesman problem
cites work: Strong linear programming relaxations for the orienteering problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
cites work: Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
cites work: Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
cites work: A Lagrangean relaxation heuristic for vehicle routing
description: scientific article; zbMATH DE number 710950