Minmax regret linear resource allocation problems
暂无分享,去创建一个
[1] Igor Averbakh,et al. On the complexity of minmax regret linear programming , 2005, Eur. J. Oper. Res..
[2] Robert J. Vanderbei,et al. Robust Optimization of Large-Scale Systems: An Emerging New Technology. , 1995 .
[3] Toshihide Ibaraki,et al. Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.
[4] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Hande Yaman,et al. The robust spanning tree problem with interval data , 2001, Oper. Res. Lett..
[7] Igor Averbakh,et al. On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..
[8] Robert J. Vanderbei,et al. Robust Optimization of Large-Scale Systems , 1995, Oper. Res..
[9] Arkadi Nemirovski,et al. Robust Convex Optimization , 1998, Math. Oper. Res..