Minmax regret linear resource allocation problems. (Q1417598): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On the complexity of minmax regret linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / 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 Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust spanning tree problem with interval data / rank
 
Normal rank

Latest revision as of 13:34, 6 June 2024

scientific article
Language Label Description Also known as
English
Minmax regret linear resource allocation problems.
scientific article

    Statements

    Minmax regret linear resource allocation problems. (English)
    0 references
    0 references
    5 January 2004
    0 references
    0 references
    Polynomial algorithm
    0 references
    Complexity
    0 references
    Minmax regret optimization
    0 references