Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q378714
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Swaroop Darbha / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Blossom V / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Boost / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124273608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / 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: The Traveling Salesman Problem with Distances One and Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / 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: Q3002787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming formulations of multiple salesman problems and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Planes Algorithm for the m-Salesmen Problem / 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: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blossom V: A new implementation of a minimum cost perfect matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank

Latest revision as of 12:11, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
scientific article

    Statements

    Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2012
    0 references
    approximation algorithms
    0 references
    heuristics
    0 references
    Hamiltonian path
    0 references
    heterogeneous vehicles
    0 references
    vehicle routing
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references