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)- The robust spanning tree problem with interval data
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
- Robustness in operational research and decision aiding: a multi-faceted issue
- Preference programming for robust portfolio modeling and project selection
- Risk measures in stochastic programming and robust optimization problems
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Executing production schedules in the face of uncertainties: a review and some future directions
- Project scheduling under uncertainty: survey and research potentials
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- A family of inequalities valid for the robust single machine scheduling polyhedron
- Complexity of the min-max (regret) versions of min cut problems
- Algorithms for the robust 1-center problem on a tree
- Stochastic constraint programming: A scenario-based approach
- An enhanced exact procedure for the absolute robust shortest path problem
- Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
- scientific article; zbMATH DE number 764410 (Why is no real title available?)
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Robust improvement schemes for road networks under demand uncertainty
- Complexity of the min-max and min-max regret assignment problems
- A robust optimization approach to wine grape harvesting scheduling
- The dynamic frequency assignment problem
- Robust multiobjective optimization with application to Internet routing
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Approximate robust optimization for the connected facility location problem
- Interval data minmax regret network optimization problems
- Reduction approaches for robust shortest path problems
- Single machine robust scheduling with budgeted uncertainty
- Robust portfolio modeling with incomplete cost information and project interdependencies
- A two-stage stochastic programming approach for project planning with uncertain activity durations
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Scenario based robust line balancing: Computational complexity
- A note on the minmax regret centdian location on trees
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- An overview of bilevel optimization
- A survey on metaheuristics for stochastic combinatorial optimization
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Robust scheduling on a single machine to minimize total flow time
- On the complexity of the robust spanning tree problem with interval data
- Generalized light robustness and the trade-off between robustness and nominal quality
- Maximizing the net present value of a project under uncertainty
- Fair resource allocation for different scenarios of demands
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Risk-averse two-stage stochastic programs in furniture plants
- A discussion of scalarization techniques for multiple objective integer programming
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- An application of deterministic and robust optimization in the wood cutting industry
- A concept of a robust solution of a multicriterial linear programming problem
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- The design of robust value-creating supply chain networks: a critical review
- Preferences in artificial intelligence
- Persistence in discrete optimization under data uncertainty
- Robust discrete optimization and network flows
- Robust optimization analysis for multiple attribute decision making problems with imprecise information
- Minimax regret spanning arborescences under uncertain costs
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- Facility location problems with uncertainty on the plane
- A combination of flow shop scheduling and the shortest path problem
- The relationship between multi-objective robustness concepts and set-valued optimization
- Complexity results and exact algorithms for robust knapsack problems
- The construction of stable project baseline schedules
- A generic stochastic model for supply-and-return network design
- Robust multiobjective portfolio optimization: A minimax regret approach
- A relative robust approach on expected returns with bounded CVaR for portfolio selection
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Assignment problems: a golden anniversary survey
- An exact algorithm for the robust shortest path problem with interval data
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Strategic facility location: A review
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Minmax regret solutions for minimax optimization problems with uncertainty
- Minmax robustness for multi-objective optimization problems
- Minmax regret 1-facility location on uncertain path networks
- Scenario-based portfolio selection of investment projects with incomplete probability and utility information
- A branch and bound algorithm for the robust shortest path problem with interval data.
- An improved algorithm for the minmax regret median problem on a tree
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- A two-stage stochastic programming model for transportation network protection
- 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
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)
