Linear programming with interval right hand sides (Q3566454): 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.1111/j.1475-3995.2009.00737.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003494596 / 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: Interval data minmax regret network optimization problems / 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 solutions of uncertain linear programs / 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 Robust Optimization Approach to Inventory Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming with interval coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness and duality in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret solution to linear programming problems with an interval objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients / 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: An exact algorithm for the robust shortest path problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust shortest path problem with interval data via Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust shortest path problem with interval data. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / 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 solutions and methods in decision-aid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust spanning tree problem with interval data / rank
 
Normal rank

Latest revision as of 22:10, 2 July 2024

scientific article
Language Label Description Also known as
English
Linear programming with interval right hand sides
scientific article

    Statements

    Linear programming with interval right hand sides (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2010
    0 references
    linear programming
    0 references
    interval right hand side
    0 references
    robustness analysis
    0 references
    worst case criteria
    0 references
    complexity theory
    0 references

    Identifiers