Pages that link to "Item:Q1019293"
From MaRDI portal
The following pages link to Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293):
Displaying 19 items.
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Deterministic risk control for cost-effective network connections (Q621844) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem'' (Q1675565) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- Minimizing maximum risk for fair network connection with interval data (Q2267272) (← links)
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) (← links)
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems (Q3055576) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
