Robust discrete optimization and its applications
From MaRDI portal
Publication:1353370
zbMATH Open0873.90071MaRDI QIDQ1353370FDOQ1353370
Authors: Panos Kouvelis, Gang Yu 
Publication date: 29 April 1997
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Recommendations
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)
Cited In (only showing first 100 items - show all)
- Approximating Single Machine Scheduling with Scenarios
- The robust minimum spanning tree problem: compact and convex uncertainty
- Algorithms for the minmax regret path problem with interval data
- Robust unit commitment with \(n-1\) security criteria
- An \(s\)-\(t\) connection problem with adaptability
- Scheduling with uncertainties on new computing platforms
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- On the minmax regret path median problem on trees
- Robust resource allocations in temporal networks
- Sensitivity analysis of scheduling algorithms
- On robust online scheduling algorithms
- Improved approximation algorithms for the Min-Max selecting items problem
- Robust capacity assignment in telecommunications
- Robust location problems with pos/neg weights on a tree
- Sensitivity bounds for machine scheduling with uncertain communication delays
- 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
- Relative utility bounds for empirically optimal portfolios
- Semidefinite and conic programming for robust wireless OFDMA networks
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- The minimum spanning tree problem with fuzzy costs
- Restricted robust uniform matroid maximization under interval uncertainty
- Routing optimization under uncertainty
- Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany
- On combinatorial optimization problems on matroids with uncertain weights
- On the approximability of robust spanning tree problems
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Portfolio optimization with \(pw\)-robustness
- On the approximability of minmax (regret) network optimization problems
- Maximizing the minimum voter satisfaction on spanning trees
- Some tractable instances of interval data minmax regret problems
- On a robustness property in single-facility location in continuous space
- On the value of using group discounts under price competition
- Conditional median as a robust solution concept for uncapacitated location problems
- Flexible-attribute problems
- Robust portfolio optimization: a categorized bibliographic review
- One approach to solving a discrete production planning problem with interval data
- A note on maximizing the minimum voter satisfaction on spanning trees
- Deterministic risk control for cost-effective network connections
- Minmax regret linear resource allocation problems.
- Two-stage flexible-choice problems under uncertainty
- Application of robust optimization to the Sawmill planning problem
- A decision-theoretic approach to robust optimization in multivalued graphs
- The Complexity of Bottleneck Labeled Graph Problems
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- 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
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- Robust single machine scheduling with a flexible maintenance activity
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- Robust Models for the Kidney Exchange Problem
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Scheduling Precedence Task Graphs with Disturbances
- Robust and reliable portfolio optimization formulation of a chance constrained problem
- The min-p robust optimization approach for facility location problem under uncertainty
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- Parallel Machine Scheduling with Uncertain Communication Delays
- An improved algorithm for the minmax regret path centdian problem on trees
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Risk measures in stochastic programming and robust optimization problems
- Assignment problems: a golden anniversary survey
- Generalized light robustness and the trade-off between robustness and nominal quality
- Stochastic constraint programming: A scenario-based approach
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Approximate robust optimization for the connected facility location problem
- An improved algorithm for the minmax regret median problem on a tree
- A two-stage stochastic programming model for transportation network protection
- Scenario based robust line balancing: Computational complexity
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
- Title not available (Why is that?)
- Reduction approaches for robust shortest path problems
- Robust discrete optimization and network flows
- Minmax robustness for multi-objective optimization problems
- Minmax regret 1-facility location on uncertain path networks
- The robust spanning tree problem with interval data
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Single machine robust scheduling with budgeted uncertainty
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Robust optimization analysis for multiple attribute decision making problems with imprecise information
- Preferences in artificial intelligence
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A generic stochastic model for supply-and-return network design
- Robust multiobjective portfolio optimization: A minimax regret approach
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Preference programming for robust portfolio modeling and project selection
- Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions
- Robust improvement schemes for road networks under demand uncertainty
- Interval data minmax regret network optimization problems
- Robust portfolio modeling with incomplete cost information and project interdependencies
- A note on the minmax regret centdian location on trees
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)
