Robust discrete optimization and its applications
From MaRDI portal
Publication:1353370
decision makingrobustnessflowshop schedulingbranch-and-boundBenders decompositionrobust network designpolynomially solvable problems1-median location problem on a treelocation decisionrobust discrete optimization
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Discrete location and assignment (90B80) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Recommendations
Cited in
(only showing first 100 items - show all)- Sensitivity bounds for machine scheduling with uncertain communication delays
- Parallel Machine Scheduling with Uncertain Communication Delays
- Robust resource allocations in temporal networks
- Robust capacity assignment in telecommunications
- Robust Models for the Kidney Exchange Problem
- On combinatorial optimization problems on matroids with uncertain weights
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- On the approximability of robust spanning tree problems
- A decision-theoretic approach to robust optimization in multivalued graphs
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Deterministic risk control for cost-effective network connections
- Scheduling Precedence Task Graphs with Disturbances
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Pinpointing the complexity of the interval min-max regret knapsack problem
- Robust and reliable portfolio optimization formulation of a chance constrained problem
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Two-stage flexible-choice problems under uncertainty
- One approach to solving a discrete production planning problem with interval data
- The minimum spanning tree problem with fuzzy costs
- Portfolio optimization with \(pw\)-robustness
- Semidefinite and conic programming for robust wireless OFDMA networks
- Conditional median as a robust solution concept for uncapacitated location problems
- Flexible-attribute problems
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Restricted robust uniform matroid maximization under interval uncertainty
- Robust portfolio optimization: a categorized bibliographic review
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- The Complexity of Bottleneck Labeled Graph Problems
- Approximating Single Machine Scheduling with Scenarios
- Algorithms for the minmax regret path problem with interval data
- The robust minimum spanning tree problem: compact and convex uncertainty
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- Minmax regret linear resource allocation problems.
- Sensitivity analysis of scheduling algorithms
- An improved algorithm for the minmax regret path centdian problem on trees
- A note on maximizing the minimum voter satisfaction on spanning trees
- On the approximability of minmax (regret) network optimization problems
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- Robust location problems with pos/neg weights on a tree
- On robust online scheduling algorithms
- Robust single machine scheduling with a flexible maintenance activity
- Improved approximation algorithms for the Min-Max selecting items problem
- Routing optimization under uncertainty
- Maximizing the minimum voter satisfaction on spanning trees
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- A linear time algorithm for computing minmax regret 1-median on a tree network
- A framework for co-optimization algorithm performance and its application to worst-case optimization
- Robust unit commitment with \(n-1\) security criteria
- An \(s\)-\(t\) connection problem with adaptability
- Scheduling with uncertainties on new computing platforms
- Some tractable instances of interval data minmax regret problems
- The min-p robust optimization approach for facility location problem under uncertainty
- Relative utility bounds for empirically optimal portfolios
- Application of robust optimization to the Sawmill planning problem
- Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- On a robustness property in single-facility location in continuous space
- On the minmax regret path median problem on trees
- On the value of using group discounts under price competition
- Multi-objective optimization using statistical models
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- A biobjective approach to recoverable robustness based on location planning
- Reallocation problems in scheduling
- Multiobjective solution of the uncapacitated plant location problem
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
- Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands
- Min-max regret robust optimization approach on interval data uncertainty
- The Benders decomposition algorithm: a literature review
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Minimax regret vertex 2-sink location problem in dynamic path networks
- Measures of problem uncertainty for scheduling with interval processing times
- The balanced minimum evolution problem under uncertain data
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
- An exact algorithm for the fuzzy p-median problem
- Minsum \(k\)-sink problem on path networks
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Single machine scheduling problem with interval processing times and total completion time objective
- Risk-averse single machine scheduling: complexity and approximation
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Relative robust portfolio optimization with benchmark regret
- Reliable intermodal freight network expansion with demand uncertainties and network disruptions
- Recoverable robust spanning tree problem under interval uncertainty representations
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- A classical decision theoretic perspective on worst-case analysis
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Simulated annealing algorithm for the robust spanning tree problem
- Almost robust discrete optimization
- Robust balanced optimization
- A robust lot sizing problem with ill-known demands
- Using the WOWA operator in robust discrete optimization problems
- Novel robust fuzzy mathematical programming methods
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- A novel robust fuzzy stochastic programming for closed loop supply chain network design under hybrid uncertainty
- Robust and neutral methods for aggregating preferences into an outranking relation
- An adversarial model for scheduling with testing
This page was built for publication: Robust discrete optimization and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1353370)
