The gradual covering decay location problem on a network. (Q1410306): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The \(p\) maximal cover -- \(p\) partial center problem on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—On a Modified One-Center Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gradual covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Coverage Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic procedures for the m-partial cover problem on a plane / rank
 
Normal rank

Latest revision as of 10:43, 6 June 2024

scientific article
Language Label Description Also known as
English
The gradual covering decay location problem on a network.
scientific article

    Statements

    The gradual covering decay location problem on a network. (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2003
    0 references
    Location
    0 references
    Networks
    0 references
    Integer programming
    0 references
    Maximal cover problems
    0 references

    Identifiers