 | 2011 |
|---|
| 8 |       | Francisco Reyes,
Narciso Cerpa,
Alfredo Candia-Véjar,
Matthew Bardeen:
The optimization of success probability for software projects using genetic algorithms.
Journal of Systems and Software 84(5): 775-785 (2011) |
| 7 | | 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) |
| 6 | | 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 |
|---|
| 5 | | 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 |
|---|
| 4 | | Alfredo Candia-Véjar,
Eduardo Álvarez-Miranda:
On a Class of Interval Data Minmax Regret CO Problems.
OR 2007: 123-128 |
| 2006 |
|---|
| 3 | | Alfredo Candia-Véjar,
Hugo Bravo-Azlán:
Worst-case performance of Wong's Steiner tree heuristic.
Discrete Applied Mathematics 154(5): 730-737 (2006) |
| 2004 |
|---|
| 2 | | Alfredo Candia-Véjar,
Hugo Bravo-Azlán:
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks.
Electronic Notes in Discrete Mathematics 18: 67-72 (2004) |
| 1997 |
|---|
| 1 | | Hugo Bravo-Azlán,
Alfredo Candia-Véjar:
A Metaheuristic Solution to a Constrained Steiner Tree Problem.
SCCC 1997: 16-20 |
Data released under the ODC-BY 1.0 license — See also our legal information page