Alfredo enrique candia-vejar
Alfredo enrique candia-vejar
Professor of Operations Research, Talca University
Verified email at
Cited by
Cited by
The optimization of success probability for software projects using genetic algorithms
F Reyes, N Cerpa, A Candia-Véjar, M Bardeen
Journal of Systems and Software 84 (5), 775-785, 2011
The multiple team formation problem using sociometry
JH Gutiérrez, CA Astudillo, P Ballesteros-Pérez, D Mora-Melià, ...
Computers & Operations Research 75, 150-162, 2016
An optimization model for the location of disaster refuges
F Pérez-Galarce, LJ Canales, C Vergara, A Candia-Véjar
Socio-Economic Planning Sciences 59, 56-66, 2017
Minmax regret combinatorial optimization problems: an algorithmic perspective
A Candia-Véjar, E Alvarez-Miranda, N Maculan
RAIRO-Operations Research 45 (2), 101-129, 2011
An approach for the Steiner problem in directed graphs
N Maculan, P Souza, AC Vejar
Annals of Operations Research 33 (6), 471-480, 1991
A multi-objective optimization model for the design of an effective decarbonized supply chain in mining
L Canales-Bustos, E Santibañez-González, A Candia-Véjar
International Journal of Production Economics 193, 449-464, 2017
Optimization of the harvest planning in the olive oil production: A case study in Chile
C Herrera-Cáceres, F Pérez-Galarce, E Álvarez-Miranda, A Candia-Véjar
Computers and Electronics in Agriculture 141, 147-159, 2017
On exact solutions for the minmax regret spanning tree problem
F Pérez-Galarce, E Álvarez-Miranda, A Candia-Véjar, P Toth
Computers & Operations Research 47, 114-122, 2014
Minimax regret spanning arborescences under uncertain costs
E Conde, A Candia
European Journal of Operational Research 182 (2), 561-577, 2007
Designing an environmental supply chain network in the mining industry to reduce carbon emissions
CV Valderrama, E Santibanez-González, B Pimentel, A Candia-Vejar, ...
Journal of Cleaner Production 254, 119688, 2020
A simulated annealing approach for the minmax regret path problem
F Pérez, CA Astudillo, M Bardeen, A Candia-Véjar
Proceedings of the Congresso Latino Americano de Investigación Operativa …, 2012
Algorithms for the minmax regret path problem with interval data
F Pérez-Galarce, A Candia-Véjar, C Astudillo, M Bardeen
Information Sciences 462, 218-241, 2018
Efficient algorithms for the prize collecting Steiner tree problems with interval data
E Álvarez-Miranda, A Candia, X Chen, X Hu, B Li
International Conference on Algorithmic Applications in Management, 13-24, 2010
A simulated annealing approach for minimum cost isolated failure immune networks
A Candia, H Bravo
Essays and Surveys in Metaheuristics, 169-183, 2002
Sistemas de ingeniería: Problemas, modelos y algoritmos de solución para la ayuda en la toma de decisiones
A Candia-Véjar, M González
Ingeniare. Revista chilena de ingeniería 19 (3), 310-311, 2011
Vulnerability assessment of spatial networks: models and solutions
E Álvarez-Miranda, A Candia-Véjar, E Carrizosa, F Pérez-Galarce
International Symposium on Combinatorial Optimization, 433-444, 2014
Risk models for the prize collecting steiner tree problems with interval data
E Alvarez-Miranda, A Candia-Véjar, X Chen, X Hu, B Li
Acta Mathematicae Applicatae Sinica, English Series 30 (1), 1-26, 2014
Heuristics for minimum spanning k-trees
A Candia-Véjar, H Beck Fernández
Investigación Operativa 9 (N° 1-2-3), 107-116, 2000
Deterministic risk control for cost-effective network connections
E Álvarez-Miranda, X Chen, J Hu, X Hu, A Candia-Véjar
Theoretical computer science 412 (3), 257-264, 2011
Worst-case performance of Wong's Steiner tree heuristic
A Candia-Véjar, H Bravo-Azlán
Discrete applied mathematics 154 (5), 730-737, 2006
The system can't perform the operation now. Try again later.
Articles 1–20