Pages that link to "Item:Q1353370"
From MaRDI portal
The following pages link to Robust discrete optimization and its applications (Q1353370):
Displaying 50 items.
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization (Q262007) (← links)
- Risk measures in stochastic programming and robust optimization problems (Q269131) (← links)
- The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty (Q291667) (← links)
- Minmax robustness for multi-objective optimization problems (Q297049) (← links)
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- Approximate robust optimization for the connected facility location problem (Q299099) (← links)
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- Preferences in artificial intelligence (Q314443) (← links)
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← 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)
- Stochastic network models for logistics planning in disaster relief (Q323517) (← links)
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
- Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← 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 decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- A bicriteria approach to robust optimization (Q342179) (← links)
- On optimizing a bi-objective flowshop scheduling problem in an uncertain environment (Q356401) (← links)
- New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Fast minimum float computation in activity networks under interval uncertainty (Q398844) (← links)
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
- Interval robust multi-objective algorithm (Q424351) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656) (← links)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Scenario-based portfolio selection of investment projects with incomplete probability and utility information (Q439347) (← links)
- Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany (Q439490) (← links)
- Fair resource allocation for different scenarios of demands (Q439500) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- A concept of a robust solution of a multicriterial linear programming problem (Q441032) (← links)
- Scenario based robust line balancing: Computational complexity (Q442208) (← links)
- On a robustness property in single-facility location in continuous space (Q458962) (← links)
- On the value of using group discounts under price competition (Q460621) (← links)
- Generalized light robustness and the trade-off between robustness and nominal quality (Q471020) (← links)
- Application of robust optimization to the Sawmill planning problem (Q475255) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
