Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
From MaRDI portal
Publication:1044085
DOI10.1016/j.ejor.2009.01.044zbMath1177.90345OpenAlexW1976579723MaRDI QIDQ1044085
Adam Kasperski, Paweł Zieliński
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.044
Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (7)
Risk models for the prize collecting Steiner tree problems with interval data ⋮ Mixed uncertainty sets for robust combinatorial optimization ⋮ Criticality analysis of activity networks under interval uncertainty ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion ⋮ Compromise solutions for robust combinatorial optimization with variable-sized uncertainty ⋮ The binary knapsack problem with qualitative levels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust discrete optimization and its applications
- Minimax regret solution to linear programming problems with an interval objective function
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Fuzzy shortest path problems incorporating interactivity among paths.
- On the complexity of the robust spanning tree problem with interval data
- On computing the latest starting times and floats of activities in a network with imprecise durations
- 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
- On the hardness of evaluating criticality of activities in a planar network with duration intervals
- On the complexity of minmax regret linear programming
- Interval Analysis in Scheduling
- Minimum flows in (s,t) planar networks
- A note on shortest path, assignment, and transportation problems
- On Possibilistic/Fuzzy Optimization
- Faster parametric shortest path and minimum‐balance algorithms
- Algorithms and Computation
- The robust spanning tree problem with interval data
- The computational complexity of the criticality problems in a network with interval activity times
This page was built for publication: Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
