Pages that link to "Item:Q1353370"

The following pages link to Robust discrete optimization and its applications (Q1353370):

Displaying 50 items.

• Comparative study of different risk measures for robust optimization of oil production under the market uncertainty: a regret-based insight (Q2192816) (← links)
• Robustness characterizations for uncertain optimization problems via image space analysis (Q2194124) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
• A modified version of stochastic dominance involving dependence (Q2197617) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• An adversarial model for scheduling with testing (Q2211361) (← links)
• On the equivalence of optimal recommendation sets and myopically optimal query sets (Q2211851) (← links)
• On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty (Q2215204) (← links)
• Robust spotter scheduling in trailer yards (Q2215562) (← links)
• Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
• Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
• Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
• A relative robust approach on expected returns with bounded CVaR for portfolio selection (Q2239973) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
• A minmax regret linear regression model under uncertainty in the dependent variable (Q2251555) (← links)
• A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
• The relationship between multi-objective robustness concepts and set-valued optimization (Q2264185) (← links)
• Minimizing maximum risk for fair network connection with interval data (Q2267272) (← links)
• A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
• A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
• Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
• Decision support for strategic energy planning: a robust optimization framework (Q2273910) (← links)
• Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)
• Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
• Novel robust fuzzy mathematical programming methods (Q2285989) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Robust supply chain network design with multi-products for a company in the food sector (Q2295953) (← links)
• Global minimum variance portfolios under uncertainty: a robust optimization approach (Q2301190) (← links)
• Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
• A unified approach through image space analysis to robustness in uncertain optimization problems (Q2302752) (← links)
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
• An application of deterministic and robust optimization in the wood cutting industry (Q2342918) (← links)
• Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)
• A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management (Q2355922) (← links)
• Robust optimization for the hazardous materials transportation network design problem (Q2355987) (← links)
• Robust and reliable portfolio optimization formulation of a chance constrained problem (Q2360112) (← links)
• The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
• The dynamic frequency assignment problem (Q2378376) (← links)
• A robust optimization approach to wine grape harvesting scheduling (Q2379552) (← links)
• Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
• A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
• A discussion of scalarization techniques for multiple objective integer programming (Q2379880) (← links)