Alfredo Candia-Véjar

Orcid: 0000-0003-2953-6522

According to our database1, Alfredo Candia-Véjar authored at least 21 papers between 1991 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Rolling Horizon scheme for rescheduling in agricultural harvest.
Comput. Electron. Agric., December, 2023

ML models for severity classification and length-of-stay forecasting in emergency units.
Expert Syst. Appl., August, 2023

2022
An optimization model for the fair distribution of prize money in ATP tournaments.
Int. J. Comput. Sci. Sport, 2022

On a Pickup to Delivery Drone Routing Problem: Models and algorithms.
Comput. Ind. Eng., 2022

2021
Improved robust shortest paths by penalized investments.
RAIRO Oper. Res., 2021

A New Truck-Drone Routing Problem for Parcel Delivery Services Aided by Parking Lots.
IEEE Access, 2021

An Optimization Model for a New Scheduling Problem: Application in a Molecular Biology Lab.
IEEE Access, 2021

2018
Algorithms for the Minmax Regret Path problem with interval data.
Inf. Sci., 2018

2017
Optimization of the harvest planning in the olive oil production: A case study in Chile.
Comput. Electron. Agric., 2017

2016
The multiple team formation problem using sociometry.
Comput. Oper. Res., 2016

2014
On exact solutions for the Minmax Regret Spanning Tree problem.
Comput. Oper. Res., 2014

Vulnerability Assessment of Spatial Networks: Models and Solutions.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2011
Deterministic risk control for cost-effective network connections.
Theor. Comput. Sci., 2011

Minmax regret combinatorial optimization problems: an Algorithmic Perspective.
RAIRO Oper. Res., 2011

The optimization of success probability for software projects using genetic algorithms.
J. Syst. Softw., 2011

2010
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2007
On a Class of Interval Data Minmax Regret CO Problems.
Proceedings of the Operations Research, 2007

2006
Worst-case performance of Wong's Steiner tree heuristic.
Discret. Appl. Math., 2006

2004
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks.
Electron. Notes Discret. Math., 2004

1997
A Metaheuristic Solution to a Constrained Steiner Tree Problem.
Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997

1991
An approach for the Steiner problem in directed graphs.
Ann. Oper. Res., 1991


  Loading...