Minmax regret location--allocation problem on a network under uncertainty (Q864020): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / 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.1016/j.ejor.2005.11.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042461890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with 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: Minmax Regret Median Location on a Network Under Uncertainty / 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: A note on the robust 1-center problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fractional model for locating semi-desirable facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving nonconvex planar location problems by finite dominating sets / 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: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical properties of the Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Dominating Sets for Network Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic results for ordered median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible approach to location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-obnoxious location models: A global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound on the complexity of the all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting weighted distances with applications to objective function evaluations in single facility location problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040780 / rank
 
Normal rank

Latest revision as of 14:05, 25 June 2024

scientific article
Language Label Description Also known as
English
Minmax regret location--allocation problem on a network under uncertainty
scientific article

    Statements

    Minmax regret location--allocation problem on a network under uncertainty (English)
    0 references
    12 February 2007
    0 references
    0 references
    location problems
    0 references
    polynomial algorithms
    0 references
    complexity
    0 references
    robust optimization
    0 references
    0 references
    0 references