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)

• 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
• The minmax regret permutation flow-shop problem with two jobs
• Multi-scenario multi-objective optimization with applications in engineering design
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• A polynomial solvable minimum risk spanning tree problem with interval data
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
• Strong formulations of robust mixed 0-1 programming
• Approximability of the robust representatives selection problem
• An approach to robust network design in telecommunications
• Min-max and min-max (relative) regret approaches to representatives selection problem
• Polynomial traffic demand polytope partitioning
• Formulation and algorithms for the robust maximal covering location problem
• The robust shortest path problem in series -- parallel multidigraphs with interval data
• Algorithm robust for the bicriteria discrete optimization problem
• Minmax regret maximal covering location problems with edge demands
• Location of Emergency Facilities with Uncertainty in the Demands
• Robust min-max regret covering problems
• Minimizing maximum risk for fair network connection with interval data
• Biobjective robust optimization over the efficient set for Pareto set reduction
• Adjustable robustness for multi-attribute project portfolio selection
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
• Robust storage loading problems with stacking and payload constraints
• Stochastic network models for logistics planning in disaster relief
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• Min-max-min robust combinatorial optimization
• On the recoverable robust traveling salesman problem
• Robust vertex \(p\)-center model for locating urgent relief distribution centers
• Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• The robust knapsack problem with queries
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights
• Disruption management in production planning
• The robust set covering problem with interval data
• Combinatorial optimization problems with uncertain costs and the OWA criterion
• Robust UAV mission planning
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
• About the applicability of MCDA to some robustness problems
• Minimizing total weighted completion time with uncertain data: a stability approach
• Robust flows with losses and improvability in evacuation planning
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• Algorithms and complexity analysis for robust single-machine scheduling problems
• On 2-stage robust LP with RHS uncertainty: complexity results and applications
• An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
• A bicriteria approach to robust optimization
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• New models for the robust shortest path problem: complexity, resolution and generalization
• A branch and bound algorithm for the robust spanning tree problem with interval data
• Interval robust multi-objective algorithm
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
• Constrained shortest path with uncertain transit times
• Scheduling for stability in single-machine production systems
• Mathematical optimization models for reallocating and sharing health equipment in pandemic situations
• A new model for path planning with interval data
• Minimizing total weighted flow time of a set of jobs with interval processing times
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
• On optimizing a bi-objective flowshop scheduling problem in an uncertain environment
• \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
• The computational complexity of the relative robust shortest path problem with interval data
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
• Min max min robust (relative) regret combinatorial optimization
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• Complexity and in-approximability of a selection problem in robust optimization
• Minimax regret 1-sink location problem in dynamic path networks
• Consistency stability intervals for a judgement in AHP decision support systems
• 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

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)