Possibilistic bottleneck combinatorial optimization problems with ill-known weights

DOI10.1016/j.ijar.2011.01.003zbMath1242.90195OpenAlexW2044077650MaRDI QIDQ433509

Publication date: 5 July 2012

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2011.01.003

zbMATH Keywords

interval possibility theory robust optimization fuzzy interval bottleneck combinatorial optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (1)

Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

Cites Work

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

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