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)- 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
- Robust scheduling with budgeted uncertainty
- A preference-based approach to spanning trees and shortest paths problems
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- Heuristics for the central tree problem
- Bulk-robust combinatorial optimization
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- Robust recoverable and two-stage selection problems
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- A minmax regret linear regression model under uncertainty in the dependent variable
- Models for robust tactical planning in multi-stage production systems with uncertain demands
- 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
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)
