Author:
Kasperski Adam,Zieliński Paweł
Subject
Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference28 articles.
1. Minimum flows in (s,t) planar networks;Adlakha;Networks,1991
2. H. Aissi, C. Bazgan, D. Vanderpooten, Complexity of the min–max (regret) versions of cut problems, ISAAC 2005, LNCS, vol. 3827, pp. 789–798, 2005.
3. Complexity of the min–max and min–max regret assignment problems;Aissi;Operations Research Letters,2005
4. H. Aissi, C. Bazgan, D. Vanderpooten, Min–max and min–max regret versions of combinatorial optimization problems: A survey, European Journal of Operational Research, in press, doi:10.1016/j.ejor.2008.09.012.
5. On the complexity of the robust spanning tree problem with interval data;Aron;Operations Research Letters,2004
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献