Publication | Closed Access

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem

Mathematical ProgrammingEngineeringContinuous OptimizationStochastic OptimizationUncertainty QuantificationOptimization ProblemConvex OptimizationMidpoint SolutionNew BoundComputer ScienceMinmax Regret OptimizationCombinatorial OptimizationIterated Local SearchApproximation TheoryOperations Research