Author:
Aissi Hassene,Bazgan Cristina,Vanderpooten Daniel
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference15 articles.
1. Approximation complexity of min–max (regret) versions of shortest path, spanning tree, and knapsack;Aissi,2005
2. Complexity of the min–max and min–max regret assignment problem;Aissi;Operations Research Letters,2005
3. Multicriteria global minimum cuts;Armon,2004
4. On the complexity of the robust spanning tree with interval data;Aron;Operations Research Letters,2004
5. Interval data min–max regret network optimization problems;Averbakh;Discrete Applied Mathematics,2004
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献