Emanuela Guerriero

Orcid: 0000-0002-8959-5017

According to our database1, Emanuela Guerriero authored at least 35 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A multi-modal tourist trip planner integrating road and pedestrian networks.
Expert Syst. Appl., March, 2024

A review of recent advances in time-dependent vehicle routing.
Eur. J. Oper. Res., 2024

Real-time schedule adjustments for conflict-free vehicle routing.
Comput. Oper. Res., 2024

Crop planting layout optimization in sustainable agriculture: A constraint programming approach.
Comput. Electron. Agric., 2024

2023
Recovering feasibility in real-time conflict-free vehicle routing.
Comput. Ind. Eng., September, 2023

A Surprisal-Based Greedy Heuristic for the Set Covering Problem.
Algorithms, July, 2023

Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem.
IEEE Access, 2023

2021
The multi-period p-center problem with time-dependent travel times.
Comput. Oper. Res., 2021

On path ranking in time-dependent graphs.
Comput. Oper. Res., 2021

Properties and Bounds for the Single-vehicle Capacitated Routing Problem with Time-dependent Travel Times and Multiple Trips.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

2020
Ejection chain moves for automatic neighborhood synthesis in constrained cardinality-minimization problems.
Int. Trans. Oper. Res., 2020

A learn-and-construct framework for general mixed-integer programming problems.
Int. Trans. Oper. Res., 2020

An enhanced lower bound for the Time-Dependent Travelling Salesman Problem.
Comput. Oper. Res., 2020

Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning.
Algorithms, 2020

2019
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm.
Discret. Appl. Math., 2019

A branch-and-bound algorithm for the time-Dependent rural postman problem.
Comput. Oper. Res., 2019

2018
Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows.
Transp. Sci., 2018

A branch-and-bound algorithm for the time-dependent travelling salesman problem.
Networks, 2018

2017
Time-Dependent Routing.
Comput. Oper. Res., 2017

MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration.
Comput. Oper. Res., 2017

Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs.
4OR, 2017

2016
Neighborhood Synthesis from an Ensemble of MIP and CP Models.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

2015
The time-dependent quickest path problem: Properties and bounds.
Networks, 2015

Time-dependent routing problems: A review.
Comput. Oper. Res., 2015

2014
A Note on the Ichoua, Gendreau, and Potvin (2003) Travel Time Model.
Transp. Sci., 2014

Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem.
Transp. Sci., 2014

A lower bound for the quickest path problem.
Comput. Oper. Res., 2014

Producing, storing, using and selling renewable energy: The best mix for the small medium industry.
Comput. Ind., 2014

2010
Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem.
Networks, 2010

2008
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs.
Comput. Oper. Res., 2008

2006
Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem.
Comput. Optim. Appl., 2006

2005
Robust scheduling of parallel machines with sequence-dependent set-up costs.
Eur. J. Oper. Res., 2005

2004
Operations research methods for resource management and scheduling in a computational grid: a survey.
Proceedings of the Grid Computing: The New Frontier of High Performance Computing [post-proceedings of the High Performance Computing Workshop, 2004

2003
Parallel tabu search for a pickup and delivery problem under track contention.
Parallel Comput., 2003

2000
Object-Oriented simulation models based on the DEVS formalism.
Proceedings of the 14<sup>th</sup> European Simulation Multiconference, 2000


  Loading...