A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hejiao Huang / rank
Normal rank
 
Property / author
 
Property / author: Hongwei David Du / rank
Normal rank
 
Property / author
 
Property / author: Hejiao Huang / rank
 
Normal rank
Property / author
 
Property / author: Hongwei David Du / 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/978-3-319-12691-3_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W420771443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating a vehicle scheduling problem with time windows and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for NP-hard geometric optimization problems: a survey / 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: Q5417633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:42, 10 July 2024

scientific article
Language Label Description Also known as
English
A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW
scientific article

    Statements

    A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (English)
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    modern logistics
    0 references
    CVRPTW
    0 references
    approximation algorithm
    0 references
    0 references