Exact algorithms for the minimum latency problem (Q834971): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complexity of the travelling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The delivery man problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for some minimum latency problems / rank
 
Normal rank

Revision as of 21:39, 1 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for the minimum latency problem
scientific article

    Statements

    Exact algorithms for the minimum latency problem (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    algorithms
    0 references
    minimum latency problem
    0 references
    dynamic programming
    0 references
    branch and bound
    0 references

    Identifiers