The following pages link to The Price of Robustness (Q3637409):
Displaying 50 items.
- Robust timing of markdowns (Q256623) (← links)
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
- Robust optimization in countably infinite linear programs (Q276340) (← links)
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty (Q291667) (← links)
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Robust optimization for interactive multiobjective programming with imprecise information applied to R\&D project portfolio selection (Q296687) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- A robust-CVaR optimization approach with application to breast cancer therapy (Q296907) (← links)
- Robust option pricing (Q297417) (← links)
- Approximate robust optimization for the connected facility location problem (Q299099) (← links)
- Robust portfolio selection under norm uncertainty (Q300545) (← links)
- Robust optimization for routing problems on trees (Q301384) (← links)
- A model enhancement heuristic for building robust aircraft maintenance personnel rosters with stochastic constraints (Q319839) (← links)
- Tactical berth allocation under uncertainty (Q320125) (← links)
- Robust transmission network expansion planning in energy systems: improving computational performance (Q320617) (← links)
- Sensitivity analysis: a review of recent advances (Q320799) (← links)
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
- Robust optimization policy benchmarks and modeling errors in natural gas (Q322565) (← links)
- Decomposition approaches for recoverable robust optimization problems (Q322768) (← links)
- Bi-objective robust optimisation (Q322907) (← links)
- Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
- Adjustable robustness for multi-attribute project portfolio selection (Q323007) (← links)
- Robust storage loading problems with stacking and payload constraints (Q323109) (← links)
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Robust optimisation of green wireless LANs under rate uncertainty and user mobility (Q325447) (← links)
- On the integration of row and column uncertainty in robust linear programming (Q330263) (← links)
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks (Q339546) (← links)
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty (Q339584) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- Robust energy-aware routing with redundancy elimination (Q342072) (← links)
- A bicriteria approach to robust optimization (Q342179) (← links)
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty (Q342259) (← links)
- SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630) (← links)
- Robust delay-constrained routing in telecommunications (Q363561) (← links)
- New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
- A robust approach to the decision rules of NPV and IRR for simple projects (Q371484) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
- Mixed complementarity problems for robust optimization equilibrium under \(l_1\cap l_\infty\)-norm (Q398504) (← links)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations (Q406645) (← links)
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
- Short sales in log-robust portfolio management (Q420886) (← links)
- Robustness and generalization (Q420915) (← links)
- Robust multi-market newsvendor models with interval demand data (Q421536) (← links)
