Robust discrete optimization and network flows
From MaRDI portal
Publication:1424278
DOI10.1007/s10107-003-0396-4zbMath1082.90067OpenAlexW2165775468WikidataQ61603113 ScholiaQ61603113MaRDI QIDQ1424278
Melvyn Sim, Dimitris J. Bertsimas
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0396-4
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items
Optimal path problems with second-order stochastic dominance constraints ⋮ Robust approach to restricted items selection problem ⋮ Online makespan minimization with budgeted uncertainty ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ Evacuation transportation planning under uncertainty: A robust optimization approach ⋮ Robust and reliable forward-reverse logistics network design under demand uncertainty and facility disruptions ⋮ Robust combinatorial optimization with variable cost uncertainty ⋮ Robust optimization for interactive multiobjective programming with imprecise information applied to R\&D project portfolio selection ⋮ Approximate robust optimization for the connected facility location problem ⋮ Lot sizing with storage losses under demand uncertainty ⋮ On robust maximum flow with polyhedral uncertainty sets ⋮ Polynomial-time identification of robust network flows under uncertain arc failures ⋮ Algorithms and uncertainty sets for data-driven robust shortest path problems ⋮ A VNS-LP algorithm for the robust dynamic maximal covering location problem ⋮ On the value of exposure and secrecy of defense system: first-mover advantage vs. robustness ⋮ Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Adjustable robustness for multi-attribute project portfolio selection ⋮ Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions ⋮ Piecewise static policies for two-stage adjustable robust linear optimization ⋮ Exact solution of the robust knapsack problem ⋮ A trilevel programming approach for electric grid defense planning ⋮ The robust knapsack problem with queries ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ A decomposition based solution algorithm for U-type assembly line balancing with interval data ⋮ Robust optimization: lessons learned from aircraft routing ⋮ Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times ⋮ A framework for secure IT operations in an uncertain and changing environment ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ Robust vehicle routing problem with hard time windows under demand and travel time uncertainty ⋮ A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks ⋮ Robust flows with losses and improvability in evacuation planning ⋮ Robust energy-aware routing with redundancy elimination ⋮ A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty ⋮ A stochastic algorithm for online bipartite resource allocation problems ⋮ Stochastic semidefinite programming: a new paradigm for stochastic optimization ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ Robust delay-constrained routing in telecommunications ⋮ Application of robust optimization to automated test assembly ⋮ On discrete optimization with ordering ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty ⋮ A robust optimization approach to dispatching technicians under stochastic service times ⋮ Revisiting \(k\)-sum optimization ⋮ Restricted robust uniform matroid maximization under interval uncertainty ⋮ Solving the robust two-stage capacitated facility location problem with uncertain transportation costs ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets ⋮ A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows ⋮ Risk models for the prize collecting Steiner tree problems with interval data ⋮ The minmax regret gradual covering location problem on a network with incomplete information of demand weights ⋮ Deterministic risk control for cost-effective network connections ⋮ Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty ⋮ Supply chain network design under uncertainty: a comprehensive review and future research directions ⋮ On 2-stage robust LP with RHS uncertainty: complexity results and applications ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ A robust mean absolute deviation model for portfolio optimization ⋮ Minmax regret bottleneck problems with solution-induced interval uncertainty structure ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ Real-time management of berth allocation with stochastic arrival and handling times ⋮ Robust optimization of graph partitioning involving interval uncertainty ⋮ Min-ordering and max-ordering scalarization methods for multi-objective robust optimization ⋮ Application of robust optimization to the Sawmill planning problem ⋮ Risk-control approach for bottleneck transportation problem with randomness and fuzziness ⋮ Combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Almost robust discrete optimization ⋮ A decomposition approach for commodity pickup and delivery with time-windows under uncertainty ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Robust balanced optimization ⋮ Constrained shortest path with uncertain transit times ⋮ Robust location transportation problems under uncertain demands ⋮ Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ Min-max regret robust optimization approach on interval data uncertainty ⋮ Robust optimization model for uncertain multiobjective linear programs ⋮ Polymatroids and mean-risk minimization in discrete optimization ⋮ A robust approach to the chance-constrained knapsack problem ⋮ Min-max-min robust combinatorial optimization ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard ⋮ An \(s\)-\(t\) connection problem with adaptability ⋮ Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard ⋮ Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ Robust optimization with simulated annealing ⋮ Robust resource allocations in temporal networks ⋮ Tractable stochastic analysis in high dimensions via robust optimization ⋮ Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty ⋮ Selected topics in robust convex optimization ⋮ Speeding up column generation for robust wireless network planning ⋮ On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Computing and minimizing the relative regret in combinatorial optimization with interval data ⋮ Relaxed robust second-order-cone programming ⋮ A note on robustness tolerances for combinatorial optimization problems ⋮ Robust optimization - a comprehensive survey ⋮ Robustness in operational research and decision aiding: a multi-faceted issue ⋮ Integer-programming software systems ⋮ Solving planning and design problems in the process industry using mixed integer and global optimization ⋮ Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement ⋮ Two-stage robust optimization problems with two-stage uncertainty ⋮ Stability factor for robust balancing of simple assembly lines under uncertainty ⋮ On the motion of substance in a channel of a network and human migration ⋮ Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration ⋮ Strategic bidding in price coupled regions ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ Robust assortment optimization under sequential product unavailability ⋮ Statistical distributions connected to motion of substance in a channel of a network ⋮ Robust combinatorial optimization with locally budgeted uncertainty ⋮ A robust multi-objective model for managing the distribution of perishable products within a green closed-loop supply chain ⋮ Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties ⋮ On safe tractable approximations of chance constraints ⋮ Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria ⋮ Robust risk management ⋮ Stochastic optimization in supply chain networks: averaging robust solutions ⋮ Generalized hose uncertainty in single-commodity robust network design ⋮ Joint chance constrained shortest path problem with Copula theory ⋮ A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization ⋮ Mixed uncertainty sets for robust combinatorial optimization ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty ⋮ On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints ⋮ Convexification of generalized network flow problem ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem ⋮ Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem ⋮ Robust optimization of fourth party logistics network design under disruptions ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ A multiobjective route robust optimization model and algorithm for hazmat transportation ⋮ Protection of flows under targeted attacks ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ A perfect information lower bound for robust lot-sizing problems ⋮ Robust combinatorial optimization under budgeted-ellipsoidal uncertainty ⋮ Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation ⋮ Robust counterpart optimization for the redundancy allocation problem in series-parallel systems with component mixing under uncertainty ⋮ Shortest path network problems with stochastic arc weights ⋮ New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ Minimizing the weighted sum of completion times under processing time uncertainty ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach ⋮ Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market ⋮ Decision-dependent probabilities in stochastic programs with recourse ⋮ Planning solid waste collection with robust optimization: location-allocation, receptacle type, and service frequency ⋮ The multi-band robust knapsack problem -- a dynamic programming approach ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ A utility theory based interactive approach to robustness in linear optimization ⋮ The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion ⋮ Anchored reactive and proactive solutions to the CPM-scheduling problem ⋮ Different stakeholders' perspectives for a surgical case assignment problem: deterministic and robust approaches ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ Robust multicovers with budgeted uncertainty ⋮ A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty ⋮ Production planning in furniture settings via robust optimization ⋮ Robust portfolio selection for index tracking ⋮ Robust budget allocation via continuous submodular functions ⋮ Facility location problems with uncertainty on the plane ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost ⋮ Robust flows over time: models and complexity results ⋮ Distributionally robust discrete optimization with entropic Value-at-Risk ⋮ Robust binary optimization using a safe tractable approximation ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ A decomposition approach for optimal gas network extension with a finite set of demand scenarios ⋮ Multiple kernel learning-aided robust optimization: learning algorithm, computational tractability, and usage in multi-stage decision-making ⋮ A vehicle routing problem with distribution uncertainty in deadlines ⋮ A robust optimization approach for the multi-mode resource-constrained project scheduling problem ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ Addressing uncertainty in sugarcane harvest planning through a revised multi-choice goal programming model ⋮ Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study ⋮ A comparison between the robust risk-aware and risk-seeking managers in R\&D portfolio management ⋮ A robust optimization model for multi-product two-stage capacitated production planning under uncertainty ⋮ A robust optimization approach for an integrated dynamic cellular manufacturing system and production planning with unreliable machines ⋮ A robust service selection method based on uncertain QoS ⋮ Robust monotone submodular function maximization ⋮ The complexity of computing a robust flow ⋮ A robust data envelopment analysis model with different scenarios ⋮ Impact of compressor failures on gas transmission network capability ⋮ Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity ⋮ The gain of robustness for a storage loading problem ⋮ A constrained multi-period robust portfolio model with behavioral factors and an interval semi-absolute deviation ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ Robust minimum cost consensus model for multicriteria decision-making under uncertain circumstances ⋮ On the motion of substance in a channel and growth of random networks ⋮ The continuous maximum capacity path interdiction problem ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem ⋮ Multiskilled personnel assignment problem under uncertain demand: a benchmarking analysis ⋮ Waste collection inventory routing with non-stationary stochastic demands ⋮ The submodularity of two-stage stochastic maximum-weight independent set problems ⋮ Robust inventory problem with budgeted cumulative demand uncertainty ⋮ Derivative-free robust optimization for circuit design ⋮ A robust omnichannel pricing and ordering optimization approach with return policies based on data-driven support vector clustering ⋮ Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty ⋮ The robust crew pairing problem: model and solution methodology ⋮ Large-scale unit commitment under uncertainty ⋮ Robust multi-period fleet allocation models for bike-sharing systems ⋮ Robust and reliable portfolio optimization formulation of a chance constrained problem ⋮ The recoverable robust spanning tree problem with interval costs is polynomially solvable ⋮ Γ-robust linear complementarity problems ⋮ Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem ⋮ Recoverable robust shortest path problems ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ Oracle-Based Robust Optimization via Online Learning ⋮ Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation ⋮ Weekly self-scheduling, forward contracting, and pool involvement for an electricity producer. An adaptive robust optimization approach ⋮ An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network ⋮ The robust network loading problem with dynamic routing ⋮ A robust optimization approach to wine grape harvesting scheduling ⋮ Affinely Adjustable Robust Linear Complementarity Problems ⋮ Robust multiperiod portfolio management in the presence of transaction costs ⋮ Robust Monotone Submodular Function Maximization ⋮ Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem ⋮ On the approximability of adjustable robust convex optimization under uncertainty ⋮ Cutting plane versus compact formulations for uncertain (integer) linear programs ⋮ Robust Shift Scheduling in Call Centers ⋮ New discoveries of domination between traffic matrices ⋮ Optimization under Decision-Dependent Uncertainty ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ The last-mile delivery process with trucks and drones under uncertain energy consumption ⋮ Recoverable robust spanning tree problem under interval uncertainty representations ⋮ Robust recoverable and two-stage selection problems ⋮ An approach to the distributionally robust shortest path problem ⋮ A value function-based approach for robust surgery planning ⋮ An implementor-adversary approach for uncertain and time-correlated service times in the nurse-to-patient assignment problem ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ Optimal fleet deployment for electric vehicle sharing systems with the consideration of demand uncertainty ⋮ Arc routing under uncertainty: introduction and literature review ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Robust scheduling with budgeted uncertainty ⋮ Proportional and maxmin fairness for the sensor location problem with chance constraints ⋮ Routing optimization with time windows under uncertainty ⋮ Fuzzy and robust approach for decision-making in disaster situations ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ Robust minimum cost flow problem under consistent flow constraints ⋮ A robust optimization model for dynamic market with uncertain production cost ⋮ Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands ⋮ A Priori and A Posteriori Aggregation Procedures to Reduce Model Size in MIP Mine Planning Models ⋮ Robust recoverable 0-1 optimization problems under polyhedral uncertainty ⋮ The Complexity of Bottleneck Labeled Graph Problems ⋮ Combinatorial optimization problems with balanced regret ⋮ Unnamed Item ⋮ Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results ⋮ Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach ⋮ A robust optimization approach for the unrelated parallel machine scheduling problem ⋮ Robust maximum weighted independent-set problems on interval graphs ⋮ A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems ⋮ r-extreme signalling for congestion control ⋮ Solving two-stage robust optimization problems using a column-and-constraint generation method ⋮ Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Approximating Single Machine Scheduling with Scenarios ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Linear programming with interval right hand sides ⋮ Tractable approximations to robust conic optimization problems ⋮ Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems ⋮ Robust game theory ⋮ Robust global optimization with polynomials ⋮ Robust optimization of contaminant sensor placement for community water systems ⋮ Strong formulations of robust mixed 0-1 programming ⋮ Persistence in discrete optimization under data uncertainty ⋮ A mean-variance model for the minimum cost flow problem with stochastic arc costs ⋮ Robustness in Multi-criteria Decision Aiding ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ A note on issues of over-conservatism in robust optimization with cost uncertainty ⋮ Two-stage network constrained robust unit commitment problem ⋮ Bulk-robust combinatorial optimization ⋮ Unnamed Item ⋮ Routing Optimization Under Uncertainty ⋮ Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty ⋮ Expansion planning for waste-to-energy systems using waste forecast prediction sets ⋮ A generalised likelihood uncertainty estimation mixed-integer programming model: Application to a water resource distribution network ⋮ Generalized Bounded Rationality and Robust Multicommodity Network Design ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study ⋮ A discussion on the conservatism of robust linear optimization problems ⋮ Tractable algorithms for chance-constrained combinatorial problems ⋮ A Dynamic Programming Approach for a Class of Robust Optimization Problems ⋮ The lexicographic α-robust knapsack problem ⋮ Robust routing and optimal partitioning of a traffic demand polytope ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity ⋮ On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration ⋮ Robust Optimization for Electricity Generation ⋮ Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem ⋮ The most likely path on series-parallel networks ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ Robust Optimization for the Hazardous Materials Transportation Network Design Problem ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems ⋮ Robust optimization for the hazardous materials transportation network design problem ⋮ Packing a Knapsack of Unknown Capacity ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ Soft robust solutions to possibilistic optimization problems ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ Optimising the flight turnaround schedules: an improved sliding time windows approach based on MILP and CP models ⋮ Affine routing for robust network design ⋮ A robust biobjective optimization approach for operating a shared energy storage under price uncertainty ⋮ Robust Algorithms for TSP and Steiner Tree ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ A hierarchical supply chain model for the sugar–alcohol energy sector with robust optimization analysis ⋮ Recycling inequalities for robust combinatorial optimization with budget uncertainty ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ A survey on bilevel optimization under uncertainty ⋮ Robust Fleet Sizing and Deployment for Industrial and Independent Bulk Ocean Shipping Companies ⋮ Data-driven robust optimization using deep neural networks ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ The robust multi-plant capacitated lot-sizing problem ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ Risk‐averse optimization and resilient network flows ⋮ Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations ⋮ Single machine robust scheduling with budgeted uncertainty ⋮ Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands ⋮ Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty ⋮ Comparative analysis of linear programming relaxations for the robust knapsack problem ⋮ A branch and bound algorithm for robust binary optimization with budget uncertainty ⋮ Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Robust transshipment problem under consistent flow constraints ⋮ On the complexity of robust multi-stage problems with discrete recourse ⋮ Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ On Bilevel Optimization with Inexact Follower ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Online First-Order Framework for Robust Convex Optimization ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Robust Optimization in Non-Linear Regression for Speech and Video Quality Prediction in Mobile Multimedia Networks ⋮ The complexity of bottleneck labeled graph problems ⋮ Approximation results for makespan minimization with budgeted uncertainty ⋮ Optimal Design for Multi-Item Auctions: A Robust Optimization Approach ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback