The complexity of the travelling repairman problem (Q3709900): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1051/ita/1986200100791 / rank
Normal rank
 
Property / author
 
Property / author: Stavros S. Cosmandakis / rank
Normal rank
 
Property / author
 
Property / author: Q197784 / rank
Normal rank
 
Property / author
 
Property / author: George Papageorgiou / rank
Normal rank
 
Property / author
 
Property / author: Stavros S. Cosmandakis / rank
 
Normal rank
Property / author
 
Property / author: Christos H. Papadimitriou / rank
 
Normal rank
Property / author
 
Property / author: George Papageorgiou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W80909727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/ITA/1986200100791 / rank
 
Normal rank

Latest revision as of 18:11, 21 December 2024

scientific article
Language Label Description Also known as
English
The complexity of the travelling repairman problem
scientific article

    Statements

    The complexity of the travelling repairman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    mean-flow variant of the travelling salesman problem
    0 references
    polynomial-time algorithm
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references