Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509): 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.ijar.2011.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044077650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the maximum capacity path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for a class of bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic bottleneck spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance constrained bottleneck spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Shortest Paths Via Quasi-convex Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization under softness in a fuzzy linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Possibilistic/Fuzzy Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness in operational research and decision aiding: a multi-faceted issue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights / 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: Complexity of the min-max and min-max regret assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / 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 combinatorial optimization problems on matroids with uncertain weights / 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: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: When upper probabilities are possibility measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to Linear Programming Problems with Interactive Fuzzy Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On latest starting times and floats in activity networks with ill-known durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase algorithms for the parametric shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Combinatorial Computing and a Problem of Program Module Distribution / rank
 
Normal rank

Latest revision as of 10:12, 5 July 2024

scientific article
Language Label Description Also known as
English
Possibilistic bottleneck combinatorial optimization problems with ill-known weights
scientific article

    Statements

    Possibilistic bottleneck combinatorial optimization problems with ill-known weights (English)
    0 references
    0 references
    0 references
    5 July 2012
    0 references
    bottleneck combinatorial optimization
    0 references
    interval
    0 references
    fuzzy interval
    0 references
    possibility theory
    0 references
    robust optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers