Eduardo Conde An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. [Citation Graph (0, 0)][DBLP] Math. Program., 2004, v:100, n:2, pp:345-353 [Journal]
Eduardo Conde On the complexity of the continuous unbounded knapsack problem with uncertain coefficients. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2005, v:33, n:5, pp:481-485 [Journal]
Eduardo Conde Minmax regret location-allocation problem on a network under uncertainty. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:179, n:3, pp:1025-1039 [Journal]
Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP