 | 2011 |
|---|
| 5 |       | Eduardo Álvarez-Miranda,
Ivana Ljubic,
Paolo Toth:
Exact solutions for the robust prize-collecting steiner tree problem.
ICUMT 2011: 1-7 |
| 4 | | Alfredo Candia-Véjar,
Eduardo Álvarez-Miranda,
Nelson Maculan:
Minmax regret combinatorial optimization problems: an Algorithmic Perspective.
RAIRO - Operations Research 45(2): 101-129 (2011) |
| 3 | | Eduardo Álvarez-Miranda,
Xujin Chen,
Jie Hu,
Xiaodong Hu,
Alfredo Candia-Véjar:
Deterministic risk control for cost-effective network connections.
Theor. Comput. Sci. 412(3): 257-264 (2011) |
| 2010 |
|---|
| 2 | | Eduardo Álvarez-Miranda,
Alfredo Candia-Véjar,
Xujin Chen,
Xiaodong Hu,
Bi Li:
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.
AAIM 2010: 13-24 |
| 2007 |
|---|
| 1 | | Alfredo Candia-Véjar,
Eduardo Álvarez-Miranda:
On a Class of Interval Data Minmax Regret CO Problems.
OR 2007: 123-128 |
Data released under the ODC-BY 1.0 license — See also our legal information page