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
- The robust spanning tree problem with interval data
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
- Robustness in operational research and decision aiding: a multi-faceted issue
- Preference programming for robust portfolio modeling and project selection
- Risk measures in stochastic programming and robust optimization problems
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Executing production schedules in the face of uncertainties: a review and some future directions
- Project scheduling under uncertainty: survey and research potentials
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- A family of inequalities valid for the robust single machine scheduling polyhedron
- Complexity of the min-max (regret) versions of min cut problems
- Algorithms for the robust 1-center problem on a tree
- Stochastic constraint programming: A scenario-based approach
- An enhanced exact procedure for the absolute robust shortest path problem
- Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
- scientific article; zbMATH DE number 764410 (Why is no real title available?)
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Robust improvement schemes for road networks under demand uncertainty
- Complexity of the min-max and min-max regret assignment problems
- A robust optimization approach to wine grape harvesting scheduling
- The dynamic frequency assignment problem
- Robust multiobjective optimization with application to Internet routing
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Approximate robust optimization for the connected facility location problem
- Interval data minmax regret network optimization problems
- Reduction approaches for robust shortest path problems
- Single machine robust scheduling with budgeted uncertainty
- Robust portfolio modeling with incomplete cost information and project interdependencies
- A two-stage stochastic programming approach for project planning with uncertain activity durations
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Scenario based robust line balancing: Computational complexity
- A note on the minmax regret centdian location on trees
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- An overview of bilevel optimization
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)
