Pages that link to "Item:Q3588419"

The following pages link to Approximation Algorithms for Reliable Stochastic Combinatorial Optimization (Q3588419):

Displaying 19 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
• Min-max-min robust combinatorial optimization (Q526823) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
• Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
• Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
• A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
• Robust budget allocation via continuous submodular functions (Q2019911) (← links)
• Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks (Q2183323) (← links)
• A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476) (← links)
• Equilibrium routing under uncertainty (Q2349119) (← links)
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (Q2364368) (← links)
• (Q5091069) (← links)
• Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
• Risk-Averse Selfish Routing (Q5219707) (← links)
• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)