Approximation results for a min-max location-routing problem (Q765374): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2011.09.014 / 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.1016/j.dam.2011.09.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008850276 / 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: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / 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: Minmax \(p\)-traveling salesmen location problems on a tree / 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: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined location-routing problems: A synthesis and future research directions / 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: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of min-max tree covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for min-max path cover problems in vehicle routing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2011.09.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:09, 10 December 2024

scientific article
Language Label Description Also known as
English
Approximation results for a min-max location-routing problem
scientific article

    Statements

    Approximation results for a min-max location-routing problem (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    approximation algorithm
    0 references
    approximation hardness
    0 references
    min-max location-routing
    0 references

    Identifiers

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