Robust discrete optimization and its applications
From MaRDI portal
(Redirected from 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)- On the equivalence of optimal recommendation sets and myopically optimal query sets
- Risk averse scheduling with scenarios
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
- Robust winner determination in positional scoring rules with uncertain weights
- Robustness characterizations for uncertain optimization problems via image space analysis
- A two-stage robust model for a reliable p-center facility location problem
- Robust optimization with belief functions
- The robust minimum spanning tree problem: compact and convex uncertainty
- Shortest paths with shortest detours. A biobjective routing problem
- Approximating Single Machine Scheduling with Scenarios
- 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
- Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints
- A robust lot sizing problem with ill-known demands
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- A unified approach through image space analysis to robustness in uncertain optimization problems
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Robust unit commitment with \(n-1\) security criteria
- The design of robust value-creating supply chain networks
- An s-t connection problem with adaptability
- Scheduling with uncertainties on new computing platforms
- Algorithms for the minmax regret path problem with interval data
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
- Robust spotter scheduling in trailer yards
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- A compact reformulation of the two-stage robust resource-constrained project scheduling problem
- Meta-heuristics for stable scheduling on a single machine
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- The complexity of machine scheduling for stability with a single disrupted job
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Criticality analysis of activity networks under interval uncertainty
- Robust resource allocations in temporal networks
- Passive cold devices for vaccine supply chains
- On the minmax regret path median problem on trees
- Robust supply chain network design with multi-products for a company in the food sector
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- On robust online scheduling algorithms
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
- Decision space robustness for multi-objective integer linear programming
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Relatively robust decisions
- A robust ordered weighted averaging loss model for portfolio optimization
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Risk measures in stochastic programming and robust optimization problems
- Geometric methods to solve max-ordering location problems
- Robust capacity assignment in telecommunications
- Improved approximation algorithms for the Min-Max selecting items problem
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Minimizing maximum cost for a single machine under uncertainty of processing times
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- 2-stage robust MILP with continuous recourse variables
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Sensitivity analysis of scheduling algorithms
- Assignment problems: a golden anniversary survey
- scientific article; zbMATH DE number 6545534 (Why is no real title available?)
- A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
- The complexity of bottleneck labeled graph problems
- The minmax regret permutation flow-shop problem with two jobs
- Generalized light robustness and the trade-off between robustness and nominal quality
- Total completion time scheduling under scenarios
- Robustness in Multi-criteria Decision Aiding
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- A polynomial solvable minimum risk spanning tree problem with interval data
- Multi-scenario multi-objective optimization with applications in engineering design
- 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
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net
- Sensitivity bounds for machine scheduling with uncertain communication delays
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Stochastic constraint programming: A scenario-based approach
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Robust location problems with pos/neg weights on a tree
- Approximate robust optimization for the connected facility location problem
- The Benders decomposition algorithm: a literature review
- Robust single machine makespan scheduling with release date uncertainty
- Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty
- A novel robust fuzzy stochastic programming for closed loop supply chain network design under hybrid uncertainty
- Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market
- A two-stage stochastic programming model for transportation network protection
- Adaptive memory programming for the robust capacitated international sourcing problem
- 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
- A survey on risk-averse and robust revenue management
- Stability of networks in stretchable graphs
- Discrete optimization methods for group model selection in compressed sensing
- Scenario based robust line balancing: Computational complexity
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Simulated annealing algorithm for the robust spanning tree problem
- A unified approach to uncertain optimization
- An improved algorithm for the minmax regret median problem on a tree
- Approximability of the robust representatives selection problem
- Relative robust portfolio optimization with benchmark regret
- Strong formulations of robust mixed 0-1 programming
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)
