Min-max regret robust optimization approach on interval data uncertainty (Q946180): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Tiravat Assavapokee / rank
 
Normal rank
Property / author
 
Property / author: Matthew J. Realff / rank
 
Normal rank
Property / author
 
Property / author: Jane C. Ammons / 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.1007/s10957-007-9334-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964367484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain 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: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of the bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multivariate partition approach to optimization problems / rank
 
Normal rank

Latest revision as of 16:29, 28 June 2024

scientific article
Language Label Description Also known as
English
Min-max regret robust optimization approach on interval data uncertainty
scientific article

    Statements

    Min-max regret robust optimization approach on interval data uncertainty (English)
    0 references
    22 September 2008
    0 references
    robust optimization
    0 references
    interval data uncertainty
    0 references
    min-max regret robust optimization
    0 references
    deviation robust optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers