default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVíctor Parada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Patricio Sáez
, Carlos Herrera, Víctor Parada:
Reducing Nervousness in Master Production Planning: A Systematic Approach Incorporating Product-Driven Strategies. Algorithms 16(8): 386 (2023)- [j27]Moisés Silva-Muñoz, Carlos Contreras Bolton, Carlos Rey, Víctor Parada:
Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming. Appl. Soft Comput. 144: 110474 (2023) - 2022
- [j26]Pedro I. Palominos, Carla Ortega, Miguel D. Alfaro, Guillermo Fuertes, Manuel Vargas, Mauricio Camargo, Víctor Parada, Gustavo Gatica:
Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem. Complex. 2022: 8903005:1-8903005:17 (2022) - 2021
- [j25]Carlos Contreras Bolton, Víctor Parada:
An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search. Int. Trans. Oper. Res. 28(3): 1190-1212 (2021) - 2020
- [j24]Lorena Pradenas, Marco Fuentes, Víctor Parada:
Optimizing waste storage areas in health care centers. Ann. Oper. Res. 295(1): 503-516 (2020) - [j23]Nicolás Acevedo, Carlos Rey, Carlos Contreras Bolton, Víctor Parada:
Automatic design of specialized algorithms for the binary knapsack problem. Expert Syst. Appl. 141 (2020)
2010 – 2019
- 2019
- [j22]Mauricio Bravo, Lorena Pradenas, Víctor Parada:
An evolutionary algorithm for the multi-objective pick-up and delivery pollution-routing problem. Int. Trans. Oper. Res. 26(1): 302-317 (2019) - [j21]Javier Durán-Micco, Lorena Pradenas, Víctor Parada:
Transit network design with pollution minimization. Public Transp. 11(1): 189-210 (2019) - [c6]Moisés Silva-Muñoz, Carlos Contreras Bolton, Gustavo Silva Semaan, Mónica Villanueva, Víctor Parada:
Novel Algorithms Automatically Generated for Optimization Problems. SCCC 2019: 1-7 - 2018
- [j20]Vittorio Bertolini, Carlos Rey, Mauricio Sepúlveda, Víctor Parada:
Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem. Sci. Program. 2018: 6971827:1-6971827:13 (2018) - 2016
- [j19]Carlos Contreras Bolton, Gustavo Gatica, Carlos Rey Barra, Víctor Parada:
A multi-operator genetic algorithm for the generalized minimum spanning tree problem. Expert Syst. Appl. 50: 1-8 (2016) - [j18]Lucas Parada, Carlos Herrera, Mauricio Sepúlveda, Víctor Parada:
Evolution of new algorithms for the binary knapsack problem. Nat. Comput. 15(1): 181-193 (2016) - [j17]Carlos Contreras Bolton, Carlos Rey, Sergio Ramos-Cossio, Claudio Rodríguez, Felipe Gatica, Víctor Parada:
Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem. Sci. Program. 2016: 1682925:1-1682925:11 (2016) - 2015
- [c5]Mauricio Solar, Mauricio Araya-López, Luis Arevalo, Víctor Parada, Ricardo Contreras, Diego Mardones:
Chilean virtual observatory. CLEI 2015: 1-7 - [c4]Carlos Herrera, José Rosales, André Thomas, Víctor Parada:
A Holonic Manufacturing System for a Copper Smelting Process. SOHOMA 2015: 189-197 - 2014
- [j16]Tomás Arce, Pablo E. Román, Juan D. Velásquez, Víctor Parada:
Identifying web sessions with simulated annealing. Expert Syst. Appl. 41(4): 1593-1600 (2014) - 2013
- [j15]Lorena Pradenas, Juan Garcés, Víctor Parada, Jacques A. Ferland:
Genotype-phenotype heuristic approaches for a cutting stock problem with circular patterns. Eng. Appl. Artif. Intell. 26(10): 2349-2355 (2013) - [j14]Lorena Pradenas, Boris Oportus, Víctor Parada:
Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling. Expert Syst. Appl. 40(8): 2985-2991 (2013) - [j13]Mauricio Solar, Jorge Sabattin, Víctor Parada:
A Maturity Model for Assessing the Use of ICT in School Education. J. Educ. Technol. Soc. 16(1): 206-218 (2013) - [c3]Lucas Parada, Mauricio Sepúlveda, Carlos Herrera, Víctor Parada:
Automatic generation of algorithms for the binary knapsack problem. IEEE Congress on Evolutionary Computation 2013: 3148-3152 - 2012
- [j12]Mauricio Solar, Jorge Rojas, Marcelo Mendoza, Raúl Monge, Víctor Parada:
A Multiagent-Based Approach to the Grid-Scheduling Problem. CLEI Electron. J. 15(2) (2012) - [j11]Cristiane Ferreira, Luiz Satoru Ochi, Víctor Parada, Eduardo Uchoa:
A GRASP-based approach to the generalized minimum spanning tree problem. Expert Syst. Appl. 39(3): 3526-3536 (2012) - [j10]Jorge Sabattin, Carlos Contreras Bolton, Miguel Arias Albornoz, Víctor Parada:
Evolutionary Optimization of Electric Power Distribution Using the Dandelion Code. J. Electr. Comput. Eng. 2012: 738409:1-738409:5 (2012) - 2010
- [j9]Andres Pailla, Athila R. Trindade, Víctor Parada, Luiz S. Ochi:
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem. Expert Syst. Appl. 37(7): 5476-5483 (2010) - [j8]Rafael Elizondo, Víctor Parada, Lorena Pradenas, Christian Artigues:
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport. J. Heuristics 16(4): 575-591 (2010)
2000 – 2009
- 2006
- [j7]Lorena Pradenas, Jorge Zúñiga, Víctor Parada:
CODELCO, Chile Programs Its Copper-Smelting Operations. Interfaces 36(4): 296-301 (2006) - [c2]Irene Zuccar, Mauricio Solar, Fernanda Kri, Víctor Parada:
A Shared-Memory Multiprocessor Scheduling Algorithm. IFIP PPAI 2006: 313-321 - 2005
- [c1]Daniel E. Acuna, Víctor Parada:
Modeling expert players' behavior through data mining. SCCC 2005: 55-61 - 2002
- [j6]Víctor Parada, Lorena Pradenas, Mauricio Solar, Rodrigo Palma:
A Hybrid Algorithm for the Non-Guillotine Cutting Problem. Ann. Oper. Res. 117(1-4): 151-163 (2002) - [j5]Mauricio Solar, Víctor Parada, Rodrigo Urrutia:
A parallel genetic algorithm to solve the set-covering problem. Comput. Oper. Res. 29(9): 1221-1235 (2002) - 2001
- [j4]Hannu Ahonen, Arlindo Gomes de Alvarenga, Attilio Provedel, Víctor Parada:
A client-broker-server architecture of a virtual enterprise for cutting stock applications. Int. J. Comput. Integr. Manuf. 14(2): 194-205 (2001) - 2000
- [j3]Víctor Parada, Rodrigo Palma, Daniel Sales, Arlindo Gómes:
A comparative numerical analysis for the guillotine two-dimensional cutting problem. Ann. Oper. Res. 96(1-4): 245-254 (2000) - [j2]Mauricio Solar, Pablo Verdugo, Víctor Parada:
Storyboard aided design to specify multimedia projects. Comput. Appl. Eng. Educ. 8(3-4): 221-228 (2000)
1990 – 1999
- 1998
- [j1]Víctor Parada, Mauricio Sepúlveda, Mauricio Solar, Arlindo Gómes:
Solution for the constrained guillotine cutting problem by simulated annealing. Comput. Oper. Res. 25(1): 37-47 (1998)
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 22:24 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:
