Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2011.06.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965056266 / 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: Two-Stage Robust Network Flow and Design Under Demand Uncertainty / 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: The minmax regret permutation flow-shop problem with two jobs / 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: Adjustable 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: 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: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 02:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
scientific article

    Statements

    Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (English)
    0 references
    5 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    lot-sizing
    0 references
    minimax regret
    0 references
    mixed integer programming
    0 references
    robust optimization
    0 references
    0 references
    0 references