Pages that link to "Item:Q1353370"
From MaRDI portal
The following pages link to Robust discrete optimization and its applications (Q1353370):
Displaying 41 items.
- Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach (Q5357767) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- An active set algorithm for robust combinatorial optimization based on separation oracles (Q5919428) (← links)
- The robust spanning tree problem with interval data (Q5949905) (← links)
- Sensitivity analysis of scheduling algorithms (Q5952510) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
- Minimax regret vertex 2-sink location problem in dynamic path networks (Q5963611) (← links)
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts (Q5964853) (← links)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
- Soft robust solutions to possibilistic optimization problems (Q6057607) (← links)
- Distributionally robust possibilistic optimization problems (Q6061516) (← links)
- Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions (Q6070503) (← links)
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands (Q6070975) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- Optimality conditions in optimization under uncertainty (Q6085816) (← links)
- Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration (Q6090155) (← links)
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)
- Price discrimination with robust beliefs (Q6106503) (← links)
- Data-driven robust optimization using deep neural networks (Q6109292) (← links)
- Mathematical optimization models for reallocating and sharing health equipment in pandemic situations (Q6113556) (← links)
- Robust optimization with belief functions (Q6116536) (← links)
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations (Q6160435) (← links)
- Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
- A robust ordered weighted averaging loss model for portfolio optimization (Q6568483) (← links)
- Total completion time scheduling under scenarios (Q6574934) (← links)
- Two-stage stochastic/robust scheduling based on permutable operation groups (Q6596975) (← links)
- Robust optimization approaches for portfolio selection: a comparative analysis (Q6601529) (← links)
- Robust optimization with scenarios using belief functions (Q6606644) (← links)
- Gaussian elimination for flexible systems of linear inclusions (Q6619405) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q6621860) (← links)
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)
- Approximating the shortest path problem with scenarios (Q6652474) (← links)
- Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)
