Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C47 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6048236 / rank
 
Normal rank
Property / zbMATH Keywords
 
minmax regret optimization
Property / zbMATH Keywords: minmax regret optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization
Property / zbMATH Keywords: robust optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
data uncertainty
Property / zbMATH Keywords: data uncertainty / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial algorithm
Property / zbMATH Keywords: polynomial algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
bottleneck problems
Property / zbMATH Keywords: bottleneck problems / 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.disopt.2010.03.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074338624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the min-max and min-max regret assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / 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: Interval data minmax regret network optimization problems / 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: On the complexity of the continuous unbounded knapsack problem with uncertain coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret spanning arborescences under uncertain costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust shortest path problem in series -- parallel multidigraphs with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition approach for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted robust uniform matroid maximization under interval uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of the relative robust shortest path problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions to Uncertain Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:37, 5 July 2024

scientific article
Language Label Description Also known as
English
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
scientific article

    Statements

    Minmax regret bottleneck problems with solution-induced interval uncertainty structure (English)
    0 references
    0 references
    20 June 2012
    0 references
    minmax regret optimization
    0 references
    robust optimization
    0 references
    data uncertainty
    0 references
    polynomial algorithm
    0 references
    bottleneck problems
    0 references
    0 references
    0 references
    0 references

    Identifiers