Possibilistic bottleneck combinatorial optimization problems with ill-known weights

Recommendations

Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
On the problem of possibilistic-probabilistic optimization with constraints on possibility/probability
On weighted vs unweighted versions of combinatorial optimization problems
Probabilistic combinatorial optimization
Computational combinatorial optimization. Optimal of probably near-optimal solutions
The problem of possibilistic-probabilistic optimization
Solving chance-constrained combinatorial problems to optimality
Bottleneck combinatorial optimization problems with fuzzy scenarios
On combinatorial optimization problems on matroids with uncertain weights
Combinatorial optimization under uncertainty

Cites work

scientific article; zbMATH DE number 3643026 (Why is no real title available?)
scientific article; zbMATH DE number 1002204 (Why is no real title available?)
scientific article; zbMATH DE number 193123 (Why is no real title available?)
A fast algorithm for a class of bottleneck problems
A linear time algorithm for the maximum capacity path problem
Algorithms for two bottleneck optimization problems
Approaches to linear programming problems with interactive fuzzy numbers
Chance constrained bottleneck spanning tree problem
Complexity of the min-max and min-max regret assignment problems
Faster parametric shortest path and minimum‐balance algorithms
Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
Interval data minmax regret network optimization problems
Introduction to Stochastic Programming
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
Minmax regret solutions for minimax optimization problems with uncertainty
Network flows. Theory, algorithms, and applications.
On Possibilistic/Fuzzy Optimization
On combinatorial optimization problems on matroids with uncertain weights
On latest starting times and floats in activity networks with ill-known durations
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Robust discrete optimization and its applications
Robust discrete optimization and network flows
Robust optimization under softness in a fuzzy linear programming problem
Robustness in operational research and decision aiding: a multi-faceted issue
Stochastic Shortest Paths Via Quasi-convex Maximization
Stochastic bottleneck spanning tree problem
The Min-Max Spanning Tree Problem and some extensions
Two-phase algorithms for the parametric shortest path problem
When upper probabilities are possibility measures

Cited in

(5)

On combinatorial optimization problems on matroids with uncertain weights
Some methods for evaluating the optimality of elements in matroids with ill-known weights
Bottleneck combinatorial optimization problems with fuzzy scenarios
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

This page was built for publication: Possibilistic bottleneck combinatorial optimization problems with ill-known weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433509)