Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115166845 / 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: Complexity of robust single facility location problems on networks with uncertain edge lengths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minmax Relative Regret Median Problem on Networks / 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: Interval data minmax regret network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equity Maximizing Facility Location Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust location problems with pos/neg weights 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: Q4229613 / 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: Minmax regret location--allocation problem on a network under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the minmax regret centdian location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arrangements of curves in the plane --- topology, combinatorics, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parametric Medians of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equity measurement in facility location analysis: A review and framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for several network location problems with equality measures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequality measures and equitable locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional median as a robust solution concept for uncapacitated location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret path location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret Single-Facility Ordered Median Location Problems on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—On the Complexity of Some Classes of Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239707 / rank
 
Normal rank

Latest revision as of 17:10, 6 July 2024

scientific article; zbMATH DE number 6195675
Language Label Description Also known as
English
Robust mean absolute deviation problems on networks with linear vertex weights
scientific article; zbMATH DE number 6195675

    Statements

    Robust mean absolute deviation problems on networks with linear vertex weights (English)
    0 references
    0 references
    6 August 2013
    0 references
    location
    0 references
    networks
    0 references
    robust optimization
    0 references
    equality measures
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references