An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: W. A. Malik / rank
Normal rank
 
Property / author
 
Property / author: W. A. Malik / rank
 
Normal rank
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.1016/j.orl.2007.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016583826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Push-Relabel Algorithm for Approximating Degree Bounded MSTs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of multidepot multisalesmen problem to the standard travelling salesman problem / 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: Degree-bounded minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on the Multiple Traveling Salesmen Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs / 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: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:38, 27 June 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
scientific article

    Statements

    An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    travelling salesman
    0 references
    vehicle routing
    0 references
    0 references