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)
- A robust lot sizing problem with ill-known demands
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- 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
- The Benders decomposition algorithm: a literature review
- A novel robust fuzzy stochastic programming for closed loop supply chain network design under hybrid uncertainty
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Relative robust portfolio optimization with benchmark regret
- Simulated annealing algorithm for the robust spanning tree problem
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- A biobjective approach to recoverable robustness based on location planning
- The balanced minimum evolution problem under uncertain data
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Robust recoverable and two-stage selection problems
- Minimax regret vertex 2-sink location problem in dynamic path networks
- Novel robust fuzzy mathematical programming methods
- Bulk-robust combinatorial optimization
- Multiobjective solution of the uncapacitated plant location problem
- An adversarial model for scheduling with testing
- Minsum \(k\)-sink problem on path networks
- Single machine scheduling problem with interval processing times and total completion time objective
- Risk-averse single machine scheduling: complexity and approximation
- Measures of problem uncertainty for scheduling with interval processing times
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
- Recoverable robust spanning tree problem under interval uncertainty representations
- Robust and neutral methods for aggregating preferences into an outranking relation
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- Multi-objective optimization using statistical models
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- Using the WOWA operator in robust discrete optimization problems
- A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- Robust scheduling 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
- Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands
- An exact algorithm for the fuzzy p-median problem
- A classical decision theoretic perspective on worst-case analysis
- Almost robust discrete optimization
- Robust balanced optimization
- Reallocation problems in scheduling
- Min-max regret robust optimization approach on interval data uncertainty
- Reliable intermodal freight network expansion with demand uncertainties and network disruptions
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Risk measures in stochastic programming and robust optimization problems
- Assignment problems: a golden anniversary survey
- Generalized light robustness and the trade-off between robustness and nominal quality
- Stochastic constraint programming: A scenario-based approach
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Approximate robust optimization for the connected facility location problem
- An improved algorithm for the minmax regret median problem on a tree
- A two-stage stochastic programming model for transportation network protection
- Scenario based robust line balancing: Computational complexity
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
- Title not available (Why is that?)
- Reduction approaches for robust shortest path problems
- Robust discrete optimization and network flows
- Minmax robustness for multi-objective optimization problems
- Minmax regret 1-facility location on uncertain path networks
- The robust spanning tree problem with interval data
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Single machine robust scheduling with budgeted uncertainty
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Robust optimization analysis for multiple attribute decision making problems with imprecise information
- Preferences in artificial intelligence
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A generic stochastic model for supply-and-return network design
- Robust multiobjective portfolio optimization: A minimax regret approach
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Preference programming for robust portfolio modeling and project selection
- Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions
- Robust improvement schemes for road networks under demand uncertainty
- Interval data minmax regret network optimization problems
- Robust portfolio modeling with incomplete cost information and project interdependencies
- A note on the minmax regret centdian location on trees
- Fair resource allocation for different scenarios of demands
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- A concept of a robust solution of a multicriterial linear programming problem
- Robustness in operational research and decision aiding: a multi-faceted issue
- Minimax regret spanning arborescences under uncertain costs
- The relationship between multi-objective robustness concepts and set-valued optimization
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Project scheduling under uncertainty: survey and research potentials
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)
