Eduardo G. Pardo

Orcid: 0000-0002-6247-5269

According to our database1, Eduardo G. Pardo authored at least 46 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Order batching problems: Taxonomy and literature review.
Eur. J. Oper. Res., February, 2024

The time-window strategy in the online order batching problem.
Int. J. Prod. Res., 2024

Strategic oscillation tabu search for improved hierarchical graph drawing.
Expert Syst. Appl., 2024

Multi-objective general variable neighborhood search for software maintainability optimization.
Eng. Appl. Artif. Intell., 2024

General Variable Neighborhood Search for the optimization of software quality.
Comput. Oper. Res., 2024

Solving a short sea inventory routing problem in the oil industry.
Comput. Ind. Eng., 2024

Optimization of Fairness and Accuracy on Logistic Regression Models.
Proceedings of the Metaheuristics - 15th International Conference, 2024

A Variable Neighborhood Search Approach for the S-labeling Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024

Exploring the Integration of General Variable Neighborhood Search with Exact Procedures for the Optimization of the Order Batching Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024

A Variable Formulation Search Approach for Three Graph Layout Problems.
Proceedings of the Metaheuristics - 15th International Conference, 2024

2023
Efficient iterated greedy for the two-dimensional bandwidth minimization problem.
Eur. J. Oper. Res., 2023

2022
On solving the order processing in picking workstations.
Optim. Lett., 2022

A variable neighborhood search approach for cyclic bandwidth sum problem.
Knowl. Based Syst., 2022

An efficient heuristic algorithm for software module clustering optimization.
J. Syst. Softw., 2022

Optimization of code caves in malware binaries to evade machine learning detectors.
Comput. Secur., 2022

A general variable neighborhood search for the cyclic antibandwidth problem.
Comput. Optim. Appl., 2022

Multi-objective Variable Neighborhood Search for Improving Software Modularity.
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

BVNS for the Minimum Sitting Arrangement Problem in a Cycle.
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

Variable Neighborhood Descent for Software Quality Optimization.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
Multistart search for the Cyclic Cutwidth Minimization Problem.
Comput. Oper. Res., 2021

A heuristic approach for the online order batching problem with multiple pickers.
Comput. Ind. Eng., 2021

BVNS Approach for the Order Processing in Parallel Picking Workstations.
Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021

Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem.
Proceedings of the Advances in Artificial Intelligence, 2021

2020
Fixed versus variable time window warehousing strategies in real time.
Prog. Artif. Intell., 2020

GRASP with Variable NCaminoseighborhood Descent for the online order batching problem.
J. Glob. Optim., 2020

Basic variable neighborhood search for the minimum sitting arrangement problem.
J. Heuristics, 2020

Special issue on recent innovations in variable neighborhood search.
J. Heuristics, 2020

2019
Basic VNS for a Variant of the Online Order Batching Problem.
Proceedings of the Variable Neighborhood Search - 7th International Conference, 2019

2018
Linear Layout Problems.
Proceedings of the Handbook of Heuristics., 2018

New VNS Variants for the Online Order Batching Problem.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2017
Parallel variable neighborhood search for the min-max order batching problem.
Int. Trans. Oper. Res., 2017

General Variable Neighborhood Search for the Order Batching and Sequencing Problem.
Eur. J. Oper. Res., 2017

4th International Conference on Variable Neighborhood Search (ICVNS'16).
Electron. Notes Discret. Math., 2017

A variable neighborhood search approach for the crew pairing problem.
Electron. Notes Discret. Math., 2017

Variable Neighborhood Search strategies for the Order Batching Problem.
Comput. Oper. Res., 2017

2016
Parallel strategic oscillation: an application to the maximum leaf spanning tree problem.
Prog. Artif. Intell., 2016

2015
Multi-objective variable neighborhood search: an application to combinatorial optimization problems.
J. Glob. Optim., 2015

Embedding signed graphs in the line - Heuristics to solve MinSA problem.
J. Comb. Optim., 2015

General Variable Neighborhood Search applied to the picking process in a warehouse.
Electron. Notes Discret. Math., 2015

2013
Heuristics and metaheuristics for the maximum diversity problem.
J. Heuristics, 2013

Branch and bound for the cutwidth minimization problem.
Comput. Oper. Res., 2013

Variable Formulation Search for the Cutwidth Minimization Problem.
Appl. Soft Comput., 2013

2012
A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem.
Electron. Notes Discret. Math., 2012

Scatter search for the cutwidth minimization problem.
Ann. Oper. Res., 2012

Automatic cognate identification based on a fuzzy combination of string similarity measures.
Proceedings of the FUZZ-IEEE 2012, 2012

2010
Linguistic description of traffic in a roundabout.
Proceedings of the FUZZ-IEEE 2010, 2010


  Loading...