Pages that link to "Item:Q723948"
From MaRDI portal
The following pages link to Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948):
Displaying 13 items.
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization (Q1713738) (← links)
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems (Q2030735) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions (Q2224924) (← links)
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty (Q2257099) (← links)
- Pareto solutions in multicriteria optimization under uncertainty (Q2333011) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets (Q4962207) (← links)
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty (Q5114395) (← links)
