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)

• 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
• An overview of bilevel optimization
• A survey on metaheuristics for stochastic combinatorial optimization
• The construction of stable project baseline schedules
• An exact algorithm for the robust shortest path problem with interval data
• Complexity of the min-max and min-max regret assignment problems
• A two-stage stochastic programming approach for project planning with uncertain activity durations
• Shortest path problems with partial information: Models and algorithms for detecting dominance
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• On the complexity of the robust spanning tree problem with interval data
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
• Complexity of the min-max (regret) versions of min cut problems
• Algorithms for the robust 1-center problem on a tree
• Maximizing the net present value of a project under uncertainty
• An application of deterministic and robust optimization in the wood cutting industry
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• The design of robust value-creating supply chain networks: a critical review
• A combination of flow shop scheduling and the shortest path problem
• Robust multiobjective optimization with application to Internet routing
• Robust scheduling on a single machine to minimize total flow time
• Risk-averse two-stage stochastic programs in furniture plants
• Facility location problems with uncertainty on the plane
• Strategic facility location: A review
• Minmax regret solutions for minimax optimization problems with uncertainty
• A family of inequalities valid for the robust single machine scheduling polyhedron
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• A relative robust approach on expected returns with bounded CVaR for portfolio selection
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• Executing production schedules in the face of uncertainties: a review and some future directions
• Complexity results and exact algorithms for robust knapsack problems
• A note on upper bounds to the robust knapsack problem with discrete scenarios
• Scenario-based portfolio selection of investment projects with incomplete probability and utility information
• A discussion of scalarization techniques for multiple objective integer programming
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Persistence in discrete optimization under data uncertainty
• A robust optimization approach to wine grape harvesting scheduling
• The dynamic frequency assignment problem
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• An enhanced exact procedure for the absolute robust shortest path problem
• Constraint-based optimization and utility elicitation using the minimax decision criterion
• A Benders decomposition approach for the robust spanning tree problem with interval data
• Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
• 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
• Meta-heuristics for stable scheduling on a single machine
• The complexity of machine scheduling for stability with a single disrupted job
• Criticality analysis of activity networks under interval uncertainty
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
• 2-stage robust MILP with continuous recourse variables
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

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)