The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.ejor.2010.08.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111215594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret p-center location on a network with demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Regret Median Location on a Network Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the robust 1-center problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the minmax regret median problem on a tree / 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 probabilistic 1-maximal covering problem on a network with discrete demand weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax-regret robust 1-median location on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty and Imprecision: Modelling and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5832743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty and rank order in the analytic hierarchy process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Statistical Decision / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of interval-probability as a unifying concept for uncertainty / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:39, 3 July 2024

scientific article
Language Label Description Also known as
English
The minmax regret gradual covering location problem on a network with incomplete information of demand weights
scientific article

    Statements

    The minmax regret gradual covering location problem on a network with incomplete information of demand weights (English)
    0 references
    0 references
    0 references
    28 January 2011
    0 references
    0 references
    location
    0 references
    network
    0 references
    gradual covering location
    0 references
    minmax regret
    0 references
    incomplete information
    0 references
    0 references