default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEduardo G. Pardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Sergio Cavero
, Manuel Laguna, Eduardo G. Pardo:
Solving a short sea inventory routing problem in the oil industry. Comput. Ind. Eng. 189: 109978 (2024)- [j31]Javier Yuste, Eduardo G. Pardo, Abraham Duarte:
General Variable Neighborhood Search for the optimization of software quality. Comput. Oper. Res. 165: 106584 (2024) - [j30]Javier Yuste, Eduardo G. Pardo, Abraham Duarte, Jin-Kao Hao:
Multi-objective general variable neighborhood search for software maintainability optimization. Eng. Appl. Artif. Intell. 133: 108593 (2024) - [j29]Eduardo G. Pardo, Sergio Gil-Borrás, Antonio Alonso-Ayuso, Abraham Duarte:
Order batching problems: Taxonomy and literature review. Eur. J. Oper. Res. 313(1): 1-24 (2024) - [j28]Sergio Cavero, Eduardo G. Pardo, Fred W. Glover, Rafael Martí:
Strategic oscillation tabu search for improved hierarchical graph drawing. Expert Syst. Appl. 243: 122668 (2024) - [j27]Sergio Gil-Borrás, Eduardo G. Pardo, Ernesto Jiménez, Kenneth Sörensen:
The time-window strategy in the online order batching problem. Int. J. Prod. Res. 62(12): 4446-4469 (2024) - [c13]Sergio Gil-Borrás, Eduardo G. Pardo:
Exploring the Integration of General Variable Neighborhood Search with Exact Procedures for the Optimization of the Order Batching Problem. MIC (1) 2024: 331-343 - [c12]Marcos Robles, Sergio Cavero, Eduardo G. Pardo:
A Variable Neighborhood Search Approach for the S-labeling Problem. MIC (1) 2024: 371-376 - [c11]Javier Yuste, Eduardo G. Pardo, Abraham Duarte:
Optimization of Fairness and Accuracy on Logistic Regression Models. MIC (1) 2024: 383-389 - [c10]Sergio Cavero, J. Manuel Colmenar, Eduardo G. Pardo:
A Variable Formulation Search Approach for Three Graph Layout Problems. MIC (1) 2024: 390-396 - [e2]Marc Sevaux, Alexandru-Liviu Olteanu, Eduardo G. Pardo, Angelo Sifaleras, Salma Makboul:
Metaheuristics - 15th International Conference, MIC 2024, Lorient, France, June 4-7, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14753, Springer 2024, ISBN 978-3-031-62911-2 [contents] - [e1]Marc Sevaux, Alexandru-Liviu Olteanu, Eduardo G. Pardo, Angelo Sifaleras, Salma Makboul:
Metaheuristics - 15th International Conference, MIC 2024, Lorient, France, June 4-7, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14754, Springer 2024, ISBN 978-3-031-62921-1 [contents] - 2023
- [j26]Sergio Cavero, Eduardo G. Pardo, Abraham Duarte:
Efficient iterated greedy for the two-dimensional bandwidth minimization problem. Eur. J. Oper. Res. 306(3): 1126-1139 (2023) - 2022
- [j25]Sergio Cavero, Eduardo G. Pardo, Abraham Duarte:
A general variable neighborhood search for the cyclic antibandwidth problem. Comput. Optim. Appl. 81(2): 657-687 (2022) - [j24]Javier Yuste, Eduardo G. Pardo, Juan Tapiador:
Optimization of code caves in malware binaries to evade machine learning detectors. Comput. Secur. 116: 102643 (2022) - [j23]Javier Yuste, Abraham Duarte, Eduardo G. Pardo:
An efficient heuristic algorithm for software module clustering optimization. J. Syst. Softw. 190: 111349 (2022) - [j22]Sergio Cavero, Eduardo G. Pardo, Abraham Duarte, Eduardo Rodriguez-Tello:
A variable neighborhood search approach for cyclic bandwidth sum problem. Knowl. Based Syst. 246: 108680 (2022) - [j21]Abdessamad Ouzidan, Marc Sevaux, Alexandru-Liviu Olteanu, Eduardo G. Pardo, Abraham Duarte:
On solving the order processing in picking workstations. Optim. Lett. 16(1): 5-35 (2022) - [c9]Javier Yuste, Eduardo G. Pardo, Abraham Duarte:
Variable Neighborhood Descent for Software Quality Optimization. MIC 2022: 531-536 - [c8]Javier Yuste, Eduardo G. Pardo, Abraham Duarte:
Multi-objective Variable Neighborhood Search for Improving Software Modularity. ICVNS 2022: 58-68 - [c7]Marcos Robles, Sergio Cavero, Eduardo G. Pardo:
BVNS for the Minimum Sitting Arrangement Problem in a Cycle. ICVNS 2022: 82-96 - 2021
- [j20]Sergio Gil-Borrás, Eduardo G. Pardo, Antonio Alonso-Ayuso, Abraham Duarte:
A heuristic approach for the online order batching problem with multiple pickers. Comput. Ind. Eng. 160: 107517 (2021) - [j19]Sergio Cavero, Eduardo G. Pardo, Manuel Laguna, Abraham Duarte:
Multistart search for the Cyclic Cutwidth Minimization Problem. Comput. Oper. Res. 126: 105116 (2021) - [c6]Sergio Cavero, Eduardo G. Pardo, Abraham Duarte:
Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem. CAEPIA 2021: 139-149 - [c5]Abdessamad Ouzidan, Eduardo G. Pardo, Marc Sevaux, Alexandru-Liviu Olteanu, Abraham Duarte:
BVNS Approach for the Order Processing in Parallel Picking Workstations. ICVNS 2021: 176-190 - 2020
- [j18]Eduardo G. Pardo, Antonio García-Sánchez, Marc Sevaux, Abraham Duarte:
Basic variable neighborhood search for the minimum sitting arrangement problem. J. Heuristics 26(2): 249-268 (2020) - [j17]Abraham Duarte, Eduardo G. Pardo:
Special issue on recent innovations in variable neighborhood search. J. Heuristics 26(3): 335-338 (2020) - [j16]Sergio Gil-Borrás, Eduardo G. Pardo, Antonio Alonso-Ayuso, Abraham Duarte:
GRASP with Variable NCaminoseighborhood Descent for the online order batching problem. J. Glob. Optim. 78(2): 295-325 (2020) - [j15]Sergio Gil-Borrás, Eduardo G. Pardo, Antonio Alonso-Ayuso, Abraham Duarte:
Fixed versus variable time window warehousing strategies in real time. Prog. Artif. Intell. 9(4): 315-324 (2020)
2010 – 2019
- 2019
- [c4]Sergio Gil-Borrás, Eduardo G. Pardo, Antonio Alonso-Ayuso, Abraham Duarte:
Basic VNS for a Variant of the Online Order Batching Problem. ICVNS 2019: 17-36 - 2018
- [c3]Sergio Gil-Borrás, Eduardo G. Pardo, Antonio Alonso-Ayuso, Abraham Duarte:
New VNS Variants for the Online Order Batching Problem. ICVNS 2018: 89-100 - [r1]Eduardo G. Pardo, Rafael Martí, Abraham Duarte:
Linear Layout Problems. Handbook of Heuristics 2018: 1025-1049 - 2017
- [j14]Borja Menéndez, Eduardo G. Pardo, Antonio Alonso-Ayuso, Elisenda Molina, Abraham Duarte:
Variable Neighborhood Search strategies for the Order Batching Problem. Comput. Oper. Res. 78: 500-512 (2017) - [j13]Eduardo G. Pardo, Angelo Sifaleras:
4th International Conference on Variable Neighborhood Search (ICVNS'16). Electron. Notes Discret. Math. 58: 1-5 (2017) - [j12]Alba Agustín, Angel A. Juan, Eduardo G. Pardo:
A variable neighborhood search approach for the crew pairing problem. Electron. Notes Discret. Math. 58: 87-94 (2017) - [j11]Borja Menéndez, Manuel Bustillo, Eduardo G. Pardo, Abraham Duarte:
General Variable Neighborhood Search for the Order Batching and Sequencing Problem. Eur. J. Oper. Res. 263(1): 82-93 (2017) - [j10]Borja Menéndez, Eduardo G. Pardo, Jesús Sánchez-Oro, Abraham Duarte:
Parallel variable neighborhood search for the min-max order batching problem. Int. Trans. Oper. Res. 24(3): 635-662 (2017) - 2016
- [j9]Jesús Sánchez-Oro, Borja Menéndez, Eduardo G. Pardo, Abraham Duarte:
Parallel strategic oscillation: an application to the maximum leaf spanning tree problem. Prog. Artif. Intell. 5(2): 121-128 (2016) - 2015
- [j8]Borja Menéndez, Eduardo G. Pardo, Abraham Duarte, Antonio Alonso-Ayuso, Elisenda Molina:
General Variable Neighborhood Search applied to the picking process in a warehouse. Electron. Notes Discret. Math. 47: 77-84 (2015) - [j7]Eduardo G. Pardo, Mauricio Soto, Christopher Thraves:
Embedding signed graphs in the line - Heuristics to solve MinSA problem. J. Comb. Optim. 29(2): 451-471 (2015) - [j6]Abraham Duarte, Juan José Pantrigo, Eduardo G. Pardo, Nenad Mladenovic:
Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Glob. Optim. 63(3): 515-536 (2015) - 2013
- [j5]Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte:
Variable Formulation Search for the Cutwidth Minimization Problem. Appl. Soft Comput. 13(5): 2242-2252 (2013) - [j4]Rafael Martí, Juan José Pantrigo, Abraham Duarte, Eduardo G. Pardo:
Branch and bound for the cutwidth minimization problem. Comput. Oper. Res. 40(1): 137-149 (2013) - [j3]Rafael Martí, Micael Gallego, Abraham Duarte, Eduardo G. Pardo:
Heuristics and metaheuristics for the maximum diversity problem. J. Heuristics 19(4): 591-615 (2013) - 2012
- [j2]Juan José Pantrigo, Rafael Martí, Abraham Duarte, Eduardo G. Pardo:
Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199(1): 285-304 (2012) - [j1]Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte:
A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem. Electron. Notes Discret. Math. 39: 67-74 (2012) - [c2]Soto Montalvo, Eduardo G. Pardo, Raquel Martínez-Unanue, Víctor Fresno:
Automatic cognate identification based on a fuzzy combination of string similarity measures. FUZZ-IEEE 2012: 1-8 - 2010
- [c1]Gracián Triviño, Alejandro Sanchez, Antonio S. Montemayor, Juan José Pantrigo, Raúl Cabido, Eduardo G. Pardo:
Linguistic description of traffic in a roundabout. FUZZ-IEEE 2010: 1-8
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-08-05 21:21 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:
