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
- Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
- A note on robustness tolerances for combinatorial optimization problems
- Fast minimum float computation in activity networks under interval uncertainty
- Risk models for the prize collecting Steiner tree problems with interval data
- Meta-heuristics for stable scheduling on a single machine
- The complexity of machine scheduling for stability with a single disrupted job
- Criticality analysis of activity networks under interval uncertainty
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
- 2-stage robust MILP with continuous recourse variables
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- The minmax regret permutation flow-shop problem with two jobs
- Multi-scenario multi-objective optimization with applications in engineering design
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- A polynomial solvable minimum risk spanning tree problem with interval data
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Strong formulations of robust mixed 0-1 programming
- Approximability of the robust representatives selection problem
- An approach to robust network design in telecommunications
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Polynomial traffic demand polytope partitioning
- Formulation and algorithms for the robust maximal covering location problem
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- Algorithm robust for the bicriteria discrete optimization problem
- Minmax regret maximal covering location problems with edge demands
- Location of Emergency Facilities with Uncertainty in the Demands
- Robust min-max regret covering problems
- Minimizing maximum risk for fair network connection with interval data
- Biobjective robust optimization over the efficient set for Pareto set reduction
- Adjustable robustness for multi-attribute project portfolio selection
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Robust storage loading problems with stacking and payload constraints
- Stochastic network models for logistics planning in disaster relief
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Min-max-min robust combinatorial optimization
- On the recoverable robust traveling salesman problem
- Robust vertex \(p\)-center model for locating urgent relief distribution centers
- Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
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)
