A defensive maximal covering problem on a network (Q3601204): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1111/j.1475-3995.2009.00660.x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SITATION / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MOD-DIST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MENU-OKF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / 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.1111/j.1475-3995.2009.00660.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976850671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximal Expected Covering Location Problem: Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating service facilities whose reliability is distance dependent. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gradual covering decay location problem on a network. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The facility and transfer points location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel mixed-integer program for critical infrastructure protection planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Solution Methods for Two Location Problems with Unreliable Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gradual covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving unreliable planar location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undesirable facility location with minimal covering objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1111/J.1475-3995.2009.00660.X / rank
 
Normal rank

Latest revision as of 12:55, 21 December 2024

scientific article
Language Label Description Also known as
English
A defensive maximal covering problem on a network
scientific article

    Statements

    A defensive maximal covering problem on a network (English)
    0 references
    10 February 2009
    0 references
    location
    0 references
    covering
    0 references
    leader-follower
    0 references
    Stackelberg equilibrium
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers