Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPTW / 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/s00453-011-9515-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1544163123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for deadline-TSP and vehicle routing with time-windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating a geometric prize-collecting traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Orienteering and Discounted-Reward TSP / 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: Q3579451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding relaxations in global constraints for solving TSP and TSPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows / 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: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems / 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: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:37, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the traveling repairman and speeding deliveryman problems
scientific article

    Statements

    Approximation algorithms for the traveling repairman and speeding deliveryman problems (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    graph algorithms
    0 references
    time windows
    0 references
    repairman problem
    0 references
    traveling salesman problem
    0 references
    0 references