PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Candia-Véjar, Alfredo"

Author of the publication

copydeleteadd this publication to your clipboard
The optimization of success probability for software projects using genetic algorithms.

, , , and . Journal of Systems and Software, 84 (5): 775-785 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Candia-Véjar, Alfredo
add a person with the name Candia-Véjar, Alfredo
 

Other publications of authors with the same name

Algorithms for the Minmax Regret Path problem with interval data., , , and . Inf. Sci., (2018)A Metaheuristic Solution to a Constrained Steiner Tree Problem., and . SCCC, page 16-20. IEEE Computer Society, (1997)On exact solutions for the Minmax Regret Spanning Tree problem., , , and . Computers & OR, (2014)Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data., , , , and . AAIM, volume 6124 of Lecture Notes in Computer Science, page 13-24. Springer, (2010)The optimization of success probability for software projects using genetic algorithms., , , and . Journal of Systems and Software, 84 (5): 775-785 (2011)Minmax regret combinatorial optimization problems: an Algorithmic Perspective., , and . RAIRO - Operations Research, 45 (2): 101-129 (2011)Vulnerability Assessment of Spatial Networks: Models and Solutions., , , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 433-444. Springer, (2014)The multiple team formation problem using sociometry., , , , and . Computers & OR, (2016)Deterministic risk control for cost-effective network connections., , , , and . Theor. Comput. Sci., 412 (3): 257-264 (2011)On a Class of Interval Data Minmax Regret CO Problems., and . OR, page 123-128. Springer, (2007)