Pages that link to "Item:Q858438"

The following pages link to Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438):

Displaying 38 items.

• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
• On the approximability of robust spanning tree problems (Q620950) (← links)
• Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
• Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
• On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← links)
• An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← links)
• Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• A unified approach to uncertain optimization (Q1753451) (← links)
• Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
• On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• Approximating the min-max (regret) selecting items problem (Q1941689) (← links)
• The polynomial robust knapsack problem (Q2103045) (← links)
• Robust pricing for airlines with partial information (Q2115756) (← links)
• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
• Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
• A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
• Representative scenario construction and preprocessing for robust combinatorial optimization problems (Q2329662) (← links)
• Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
• Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
• Combinatorial optimization problems with balanced regret (Q2685694) (← links)
• Just-in-time scheduling under scenario-based uncertainty (Q2836525) (← links)
• Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems (Q3055576) (← links)
• Efficient Algorithms for k-Regret Minimizing Sets (Q4580150) (← links)
• A Probabilistic Model for Minmax Regret in Combinatorial Optimization (Q5166306) (← links)
• Approximating the shortest path problem with scenarios (Q6652474) (← links)