Pages that link to "Item:Q5684838"

The following pages link to Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming (Q5684838):

Displaying 50 items.

• On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization (Q262007) (← links)
• Robust optimization in countably infinite linear programs (Q276340) (← links)
• Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty (Q279517) (← links)
• A maximum entropy method for a robust portfolio problem (Q296477) (← 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)
• Minmax robustness for multi-objective optimization problems (Q297049) (← links)
• Approximate robust optimization for the connected facility location problem (Q299099) (← links)
• Robust portfolio selection under norm uncertainty (Q300545) (← links)
• Robust transmission network expansion planning in energy systems: improving computational performance (Q320617) (← 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)
• Bi-objective robust optimisation (Q322907) (← links)
• On the integration of row and column uncertainty in robust linear programming (Q330263) (← links)
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
• Sufficient optimality conditions and duality theory for interval optimization problem (Q338934) (← links)
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← links)
• New reformulations of distributionally robust shortest path problem (Q342487) (← links)
• Robust delay-constrained routing in telecommunications (Q363561) (← links)
• Application of robust optimization to automated test assembly (Q363604) (← 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)
• Mixed complementarity problems for robust optimization equilibrium under \(l_1\cap l_\infty\)-norm (Q398504) (← links)
• Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations (Q406645) (← links)
• Short sales in log-robust portfolio management (Q420886) (← links)
• Robust multi-market newsvendor models with interval demand data (Q421536) (← links)
• Robust optimization and portfolio selection: the cost of robustness (Q421549) (← links)
• Robust portfolio selection involving options under a ``marginal+joint'' ellipsoidal uncertainty set (Q425328) (← links)
• On sufficiency and duality for a class of interval-valued programming problems (Q426946) (← links)
• Split cuts for robust mixed-integer optimization (Q439905) (← links)
• Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
• Staffing a call center with uncertain non-stationary arrival rate and flexibility (Q443817) (← links)
• Robust least square semidefinite programming with applications (Q457207) (← links)
• Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
• Generalized light robustness and the trade-off between robustness and nominal quality (Q471020) (← links)
• A robust optimization approach to emergency vehicle scheduling (Q474686) (← links)
• Application of robust optimization to the Sawmill planning problem (Q475255) (← links)
• A comparison of routing sets for robust network design (Q479214) (← links)
• Robust load planning of trains in intermodal transportation (Q480756) (← links)
• A robust bus evacuation model with delayed scenario information (Q480774) (← links)
• Robust UAV mission planning (Q490224) (← links)
• A resilience optimization approach for workforce-inventory control dynamics under uncertainty (Q490354) (← links)
• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
• A robust optimization approach to assess the effect of delays in the connection-to-the-grid time of new generation power plants over transmission expansion planning (Q492849) (← links)
• Robust location transportation problems under uncertain demands (Q496635) (← links)
• Distribution-dependent robust linear optimization with applications to inventory control (Q499320) (← links)
• Robust optimization of schedules affected by uncertain events (Q504821) (← links)
• Robust optimization approximation for joint chance constrained optimization problem (Q522276) (← links)
• A robust optimization approach for multicast network coding under uncertain link costs (Q526429) (← links)
• Min-max-min robust combinatorial optimization (Q526823) (← links)