A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem (Q315496): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-015-0924-1 / 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-015-0924-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W938223372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / 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: Optimal paths for a car that goes both forwards and backwards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / 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: Capacitated Vehicle Routing with Non-uniform Speeds / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-015-0924-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:12, 9 December 2024

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

    Statements

    Identifiers