A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2015.0650 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1857333123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for minimum and min-max vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multiple terminal, Hamiltonian path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation of the generalized assignment problem arising in the New Zealand dairy industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Postman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New assignment algorithms for the multi-depot vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: <b>State-of-the Art Review</b>—Evolutionary Algorithms for Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the multi-depot vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the extended Christofides heuristic for the \(k\)-depot TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem / rank
 
Normal rank

Latest revision as of 21:22, 11 July 2024

scientific article
Language Label Description Also known as
English
A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots
scientific article

    Statements

    A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (English)
    0 references
    0 references
    0 references
    25 April 2016
    0 references
    approximation algorithm
    0 references
    multiple depots
    0 references
    traveling salesman
    0 references
    matroid
    0 references

    Identifiers