Author:
Kasperski Adam,Zieliński Paweł
Publisher
Springer International Publishing
Reference91 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
2. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33, 634–640 (2005)
3. Aissi, H., Bazgan, C., Vanderpooten, D.: Approximation of min-max and min-max regret versions of some combinatorial optimization problems. Eur. J. Oper. Res. 179, 281–290 (2007)
4. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5, 66–73 (2008)
5. Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197, 427–438 (2009)
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献