Man

alfredo enrique candia vejar

UNIVERSIDAD DE TALCA

Curicó, Chile

Líneas de Investigación


Combinatorial Optimization; Mathematical Modeling; Optimization with Uncertainty


 

Article (13)

Designing an environmental supply chain network in the mining industry to reduce carbon emissions
Algorithms for the Minmax Regret Path problem with interval data
A multi-objective optimization model for the design of an effective decarbonized supply chain in mining
An optimization model for the location of disaster refuges
Optimization of the harvest planning in the olive oil production=> A case study in Chile,
The Multiple Team Formation Problem using Sociometry
On Exact Solutions for the Minmax Regret Spanning Tree problem
Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data
Deterministic Risk Control for cost effective network connections
MINMAX REGRET COMBINATORIAL OPTIMIZATION PROBLEMS: AN ALGORITHMIC PERSPECTIVE
The optimization of success probability for software projects using genetic algorithms
Minimax regret spanning arborescences under uncertain costs
Worst-case performance of Wong's Steiner tree heuristic

ConferencePaper (1)

A Simulated Annealing approach for minimum cost isolated failure immune networks

Proyecto (3)

Centro de Extensionismo Tecnológico en Logística
a. Proyecto 2015-2018=> “SmartLogistics@IB=> Red Iberoamericana de Logística Inteligente en la Gestión Sostenible del Transporte en Núcleos Urbanos”.
ON A CLASS OF ROBUST COMBINATORIAL OPTIMIZATION PROBLEMS
3
alfredo candia

UNIVERSIDAD DE TALCA

Curicó, Chile