3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
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.1007/s11590-010-0256-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996380018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / 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: \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank

Latest revision as of 23:16, 5 July 2024

scientific article
Language Label Description Also known as
English
3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
scientific article

    Statements

    3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2012
    0 references
    0 references
    traveling salesman problem
    0 references
    heterogeneous vehicle
    0 references
    0 references