Continuous facility location on graphs (Q2118124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-021-01646-x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold dominating sets and an improved characterization of \(W[2]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Continuous Fermat-Weber Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispersing obnoxious facilities on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obnoxious Facility Location on Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-021-01646-X / rank
 
Normal rank

Latest revision as of 03:08, 17 December 2024

scientific article
Language Label Description Also known as
English
Continuous facility location on graphs
scientific article

    Statements

    Continuous facility location on graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    covering
    0 references
    location theory
    0 references
    graph theory
    0 references
    complexity
    0 references
    parametrized complexity
    0 references

    Identifiers