default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfredo Candia-Véjar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Fernando Montenegro-Dos Santos
, Francisco Pérez-Galarce, Carlos Monardes-Concha, Alfredo Candia-Véjar, Marcelo Seido Nagano, Javier E. Gómez-Lagos:
A Rolling Horizon scheme for rescheduling in agricultural harvest. Comput. Electron. Agric. 215: 108392 (2023)- [j16]Jonathan Moya-Carvajal, Francisco Pérez-Galarce, Carla Taramasco, César A. Astudillo, Alfredo Candia-Véjar:
ML models for severity classification and length-of-stay forecasting in emergency units. Expert Syst. Appl. 223: 119864 (2023) - 2022
- [j15]Javier E. Gómez-Lagos, Benjamín Rojas-Espinoza, Alfredo Candia-Véjar:
On a Pickup to Delivery Drone Routing Problem: Models and algorithms. Comput. Ind. Eng. 172(Part): 108632 (2022) - [j14]Zureneth Govea, Francisco Pérez-Galarce, Alfredo Candia-Véjar:
An optimization model for the fair distribution of prize money in ATP tournaments. Int. J. Comput. Sci. Sport 21(1): 9-29 (2022) - 2021
- [j13]Javier E. Gómez-Lagos, Alfredo Candia-Véjar, Flavio Encina:
A New Truck-Drone Routing Problem for Parcel Delivery Services Aided by Parking Lots. IEEE Access 9: 11091-11108 (2021) - [j12]Guierdy Concha, Felipe Gainza, Alfredo Candia-Véjar:
An Optimization Model for a New Scheduling Problem: Application in a Molecular Biology Lab. IEEE Access 9: 146509-146524 (2021) - [j11]Francisco Pérez-Galarce, Alfredo Candia-Véjar, Guido Maculan, Nelson Maculan:
Improved robust shortest paths by penalized investments. RAIRO Oper. Res. 55(3): 1865-1883 (2021)
2010 – 2019
- 2018
- [j10]Francisco Pérez-Galarce, Alfredo Candia-Véjar, César A. Astudillo, Matthew Bardeen:
Algorithms for the Minmax Regret Path problem with interval data. Inf. Sci. 462: 218-241 (2018) - 2017
- [j9]Celso Herrera-Cáceres, Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar:
Optimization of the harvest planning in the olive oil production: A case study in Chile. Comput. Electron. Agric. 141: 147-159 (2017) - 2016
- [j8]Jimmy H. Gutiérrez, César A. Astudillo, Pablo Ballesteros-Pérez, Daniel Mora-Melià, Alfredo Candia-Véjar:
The multiple team formation problem using sociometry. Comput. Oper. Res. 75: 150-162 (2016) - 2014
- [j7]Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Paolo Toth:
On exact solutions for the Minmax Regret Spanning Tree problem. Comput. Oper. Res. 47: 114-122 (2014) - [c4]Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Emilio Carrizosa, Francisco Pérez-Galarce:
Vulnerability Assessment of Spatial Networks: Models and Solutions. ISCO 2014: 433-444 - 2011
- [j6]Francisco Reyes, Narciso Cerpa, Alfredo Candia-Véjar, Matthew Bardeen:
The optimization of success probability for software projects using genetic algorithms. J. Syst. Softw. 84(5): 775-785 (2011) - [j5]Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan:
Minmax regret combinatorial optimization problems: an Algorithmic Perspective. RAIRO Oper. Res. 45(2): 101-129 (2011) - [j4]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
- [c3]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
2000 – 2009
- 2007
- [c2]Alfredo Candia-Véjar, Eduardo Álvarez-Miranda:
On a Class of Interval Data Minmax Regret CO Problems. OR 2007: 123-128 - 2006
- [j3]Alfredo Candia-Véjar, Hugo Bravo-Azlán:
Worst-case performance of Wong's Steiner tree heuristic. Discret. Appl. Math. 154(5): 730-737 (2006) - 2004
- [j2]Alfredo Candia-Véjar, Hugo Bravo-Azlán:
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks. Electron. Notes Discret. Math. 18: 67-72 (2004)
1990 – 1999
- 1997
- [c1]Hugo Bravo-Azlán, Alfredo Candia-Véjar:
A Metaheuristic Solution to a Constrained Steiner Tree Problem. SCCC 1997: 16-20 - 1991
- [j1]Nelson Maculan, Paulo Souza, Alfredo Candia-Véjar:
An approach for the Steiner problem in directed graphs. Ann. Oper. Res. 33(6): 471-480 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
