A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 9 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-014-9906-4 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6478093 / rank
 
Normal rank
Property / zbMATH Keywords
 
geometric algorithm
Property / zbMATH Keywords: geometric algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
vehicle routing
Property / zbMATH Keywords: vehicle routing / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3012882765 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0812.1595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k / 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: Approximation schemes for NP-hard geometric optimization problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Long Can a Euclidean Traveling Salesman Tour Be? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-polynomial time approximation scheme for minimum weight triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-014-9906-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:24, 9 December 2024

scientific article
Language Label Description Also known as
English
A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
scientific article

    Statements

    A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2015
    0 references
    geometric algorithm
    0 references
    approximation algorithms
    0 references
    vehicle routing
    0 references
    combinatorial optimization
    0 references

    Identifiers