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)- Minimax regret 1-sink location problem in dynamic path networks
- Robust UAV mission planning
- Meta-heuristics for stable scheduling on a single machine
- Disruption management in production planning
- An approach to robust network design in telecommunications
- The minmax regret permutation flow-shop problem with two jobs
- Criticality analysis of activity networks under interval uncertainty
- The computational complexity of the relative robust shortest path problem with interval data
- The robust set covering problem with interval data
- Multi-scenario multi-objective optimization with applications in engineering design
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
- A bicriteria approach to robust optimization
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Mathematical optimization models for reallocating and sharing health equipment in pandemic situations
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Formulation and algorithms for the robust maximal covering location problem
- Location of Emergency Facilities with Uncertainty in the Demands
- The complexity of machine scheduling for stability with a single disrupted job
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- A note on robustness tolerances for combinatorial optimization problems
- Constrained shortest path with uncertain transit times
- Consistency stability intervals for a judgement in AHP decision support systems
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
- A new model for path planning with interval data
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Min-max-min robust combinatorial optimization
- New models for the robust shortest path problem: complexity, resolution and generalization
- Minimizing maximum risk for fair network connection with interval data
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Fast minimum float computation in activity networks under interval uncertainty
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Risk models for the prize collecting Steiner tree problems with interval data
- Scheduling for stability in single-machine production systems
- On optimizing a bi-objective flowshop scheduling problem in an uncertain environment
- Robust min-max regret covering problems
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- A branch and bound algorithm for the robust spanning tree problem with interval data
- About the applicability of MCDA to some robustness problems
- Complexity and in-approximability of a selection problem in robust optimization
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Algorithm robust for the bicriteria discrete optimization problem
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- A polynomial solvable minimum risk spanning tree problem with interval data
- Minmax regret maximal covering location problems with edge demands
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- 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
- Interval robust multi-objective algorithm
- Stochastic network models for logistics planning in disaster relief
- Strong formulations of robust mixed 0-1 programming
- Approximability of the robust representatives selection problem
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- On the recoverable robust traveling salesman problem
- Min max min robust (relative) regret combinatorial optimization
- Minimizing total weighted completion time with uncertain data: a stability approach
- Robust flows with losses and improvability in evacuation planning
- 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
- The robust knapsack problem with queries
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- 2-stage robust MILP with continuous recourse variables
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Polynomial traffic demand polytope partitioning
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- 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
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)
