Approximation results for min-max path cover problems in vehicle routing (Q3065634): 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: VRP / 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.1002/nav.20434 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055845740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for minimum and min-max vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max tree covers of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minmax rooted-tree cover in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of min-max tree covers / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:25, 3 July 2024

scientific article
Language Label Description Also known as
English
Approximation results for min-max path cover problems in vehicle routing
scientific article

    Statements

    Approximation results for min-max path cover problems in vehicle routing (English)
    0 references
    0 references
    0 references
    0 references
    6 January 2011
    0 references
    approximation algorithms
    0 references
    approximation hardness
    0 references
    min-max path cover
    0 references
    vehicle routing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references