Robust discrete optimization and its applications

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

• Robust discrete optimization and network flows
• Robust optimization
• scientific article; zbMATH DE number 764410
• The Price of Robustness
• AN ADJUSTABLE ROBUST APPROACH FOR A 1-MEDIAN LOCATION PROBLEM ON A TREE

zbMATH Keywords

decision makingrobustnessflowshop schedulingbranch-and-boundBenders decompositionrobust network designpolynomially solvable problems1-median location problem on a treelocation decisionrobust discrete optimization

Mathematics Subject Classification ID

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)

• Approximating Single Machine Scheduling with Scenarios
• The robust minimum spanning tree problem: compact and convex uncertainty
• Algorithms for the minmax regret path problem with interval data
• Robust unit commitment with \(n-1\) security criteria
• An \(s\)-\(t\) connection problem with adaptability
• Scheduling with uncertainties on new computing platforms
• A randomized algorithm for the min-Max selecting items problem with uncertain weights
• On the minmax regret path median problem on trees
• Robust resource allocations in temporal networks
• Sensitivity analysis of scheduling algorithms
• On robust online scheduling algorithms
• Improved approximation algorithms for the Min-Max selecting items problem
• Robust capacity assignment in telecommunications
• Robust location problems with pos/neg weights on a tree
• Sensitivity bounds for machine scheduling with uncertain communication delays
• 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
• Relative utility bounds for empirically optimal portfolios
• Semidefinite and conic programming for robust wireless OFDMA networks
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights
• The minimum spanning tree problem with fuzzy costs
• Restricted robust uniform matroid maximization under interval uncertainty
• Routing optimization under uncertainty
• Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany
• On combinatorial optimization problems on matroids with uncertain weights
• On the approximability of robust spanning tree problems
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times
• Portfolio optimization with \(pw\)-robustness
• On the approximability of minmax (regret) network optimization problems
• Maximizing the minimum voter satisfaction on spanning trees
• Some tractable instances of interval data minmax regret problems
• On a robustness property in single-facility location in continuous space
• On the value of using group discounts under price competition
• Conditional median as a robust solution concept for uncapacitated location problems
• Flexible-attribute problems
• Robust portfolio optimization: a categorized bibliographic review
• One approach to solving a discrete production planning problem with interval data
• A note on maximizing the minimum voter satisfaction on spanning trees
• Deterministic risk control for cost-effective network connections
• Minmax regret linear resource allocation problems.
• Two-stage flexible-choice problems under uncertainty
• Application of robust optimization to the Sawmill planning problem
• A decision-theoretic approach to robust optimization in multivalued graphs
• The Complexity of Bottleneck Labeled Graph Problems
• Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• A linear time algorithm for computing minmax regret 1-median on a tree network
• A framework for co-optimization algorithm performance and its application to worst-case optimization
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
• Robust single machine scheduling with a flexible maintenance activity
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
• Robust Models for the Kidney Exchange Problem
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Scheduling Precedence Task Graphs with Disturbances
• Robust and reliable portfolio optimization formulation of a chance constrained problem
• The min-p robust optimization approach for facility location problem under uncertainty
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties
• Parallel Machine Scheduling with Uncertain Communication Delays
• An improved algorithm for the minmax regret path centdian problem on trees
• 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
• 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

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)