Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
type: Item
instance of: scholarly article
title: Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
zbMATH Open document ID: 1244.90032
author: Riddhi Doshi
author: Sai Yadlapalli
author: Sivakumar Rathinam
author: S. Darbha
published in: International Journal of Robust and Nonlinear Control
publication date: 2012-08-04T00:00:00Z
full work available at URL: ETD-TAMU-2010-08-7736
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6063212
zbMATH Keywords: approximation algorithms
zbMATH Keywords: heuristics
zbMATH Keywords: Hamiltonian path
zbMATH Keywords: heterogeneous vehicles
zbMATH Keywords: vehicle routing
describes a project that uses: Blossom V
describes a project that uses: LKH
describes a project that uses: Boost
MaRDI profile type: Publication
OpenAlex ID: W2124273608
cites work: Q4869540
cites work: The traveling salesman problem and its variations
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles
cites work: Q3002787
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Integer linear programming formulations of multiple salesman problems and its variations
cites work: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
cites work: A Cutting Planes Algorithm for the m-Salesmen Problem
cites work: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
cites work: \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
cites work: Blossom V: A new implementation of a minimum cost perfect matching algorithm
cites work: Paths, Trees, and Flowers
DOI: 10.1002/RNC.1701
description: scientific article; zbMATH DE number 6063212