Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2017.08.006 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2017.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2767276898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / 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 to Uncertain Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions to Least-Squares Problems with Uncertain Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Adaptability in Multistage Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i>-Adaptability in Two-Stage Robust Binary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max-min robust combinatorial optimization / 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: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean Decomposition for Mean-Variance Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria global minimum cuts / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2017.08.006 / rank
 
Normal rank

Latest revision as of 01:45, 11 December 2024

scientific article
Language Label Description Also known as
English
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
scientific article

    Statements

    Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (English)
    0 references
    0 references
    0 references
    17 August 2018
    0 references
    robust optimization
    0 references
    \(k\)-adaptability
    0 references
    discrete uncertainty
    0 references

    Identifiers