Pages that link to "Item:Q1849501"

The following pages link to Robust optimization-methodology and applications (Q1849501):

Displaying 50 items.

• Supermodular covering knapsack polytope (Q1751131) (← links)
• A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
• A survey on robustness in railway planning (Q1754050) (← links)
• Robust storage assignment in stack- and queue-based storage systems (Q1782174) (← links)
• Robust binary optimization using a safe tractable approximation (Q1785400) (← links)
• Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
• On the average performance of the adjustable RO and its use as an offline tool for multi-period production planning under uncertainty (Q1789600) (← links)
• A robust optimization model for multi-product two-stage capacitated production planning under uncertainty (Q1791463) (← links)
• Tractable approximation to robust nonlinear production frontier problem (Q1925472) (← links)
• Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
• Robust combinatorial optimization with variable budgeted uncertainty (Q1942010) (← links)
• The whole random optimization with application (Q1949578) (← links)
• Portfolio selection under model uncertainty: a penalized moment-based optimization approach (Q1955553) (← links)
• Prescriptive analytics for human resource planning in the professional services industry (Q1991173) (← links)
• A certified model reduction approach for robust parameter optimization with PDE constraints (Q2000521) (← links)
• Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
• Robust multi-period and multi-objective portfolio selection (Q2031367) (← links)
• Global optimality condition for quadratic optimization problems under data uncertainty (Q2045908) (← links)
• An interval branch and bound method for global robust optimization (Q2046260) (← links)
• Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function (Q2053413) (← links)
• On the complexity of robust bilevel optimization with uncertain follower's objective (Q2060358) (← links)
• An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty (Q2071422) (← links)
• Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators (Q2074630) (← links)
• Biobjective robust simulation-based optimization for unconstrained problems (Q2077985) (← links)
• Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach (Q2079686) (← links)
• A new data-driven robust optimization approach to multi-item newsboy problems (Q2083366) (← links)
• Near-optimal solutions of convex semi-infinite programs via targeted sampling (Q2095909) (← links)
• Norm induced polyhedral uncertainty sets for robust linear optimization (Q2101644) (← links)
• Accounting for non-normal distribution of input variables and their correlations in robust optimization (Q2101649) (← links)
• ROmodel: modeling robust optimization problems in pyomo (Q2101652) (← links)
• An interval sequential linear programming for nonlinear robust optimization problems (Q2109530) (← links)
• Two-stage linear decision rules for multi-stage stochastic programming (Q2118081) (← links)
• Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces (Q2139119) (← links)
• On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
• LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions (Q2154456) (← links)
• An algorithmic approach to multiobjective optimization with decision uncertainty (Q2173509) (← links)
• Characterization of norm-based robust solutions in vector optimization (Q2178894) (← links)
• Uncertain bidding zone configurations: the role of expectations for transmission and generation capacity expansion (Q2183344) (← links)
• Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
• A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization (Q2191764) (← links)
• Robust spotter scheduling in trailer yards (Q2215562) (← links)
• On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
• Support vector regression for polyhedral and missing data (Q2241195) (← links)
• The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
• Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
• Robust linear optimization under matrix completion (Q2254817) (← links)
• Strong and total Fenchel dualities for robust convex optimization problems (Q2262012) (← links)
• Robust optimization of the rate of penetration of a drill-string using a stochastic nonlinear dynamical model (Q2268481) (← links)
• Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)