On the complexity of minmax regret linear programming-Reference-Cited by-同舟云学术

On the complexity of minmax regret linear programming

Published:2005-01 Issue:1 Volume:160 Page:227-231
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Averbakh Igor,Lebedev Vasilij

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference10 articles.

1. On the complexity of a class of combinatorial optimization problems with uncertainty;Averbakh;Mathematical Programming,2001

2. Introduction to Linear Optimization;Bertsimas,1997

3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

4. Minimax regret solution to linear programming problems with an interval objective function;Inuiguchi;European Journal of Operational Research,1995

5. M. Inuiguchi, M. Sakawa, Maximum regret analysis in linear programs with an interval objective function, in: Proceedings of IWSCI'96, 308–317

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty;RAIRO - Operations Research;2022-11

2. Home Health Care Scheduling Problem Under Uncertainty: Robust Optimization Approaches;Computing and Informatics;2022

3. Minimising weighted completion time on a single machine under uncertain weights;International Journal of Automation and Control;2022

4. Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems;Operations Research;2021-12-17

5. An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives;INFORMS Journal on Computing;2021-07