Valentina Cacchiani

Orcid: 0000-0002-6269-7136

According to our database1, Valentina Cacchiani authored at least 47 papers between 2008 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems.
Int. Trans. Oper. Res., 2023

2022
An iterative heuristic for passenger-centric train timetabling with integrated adaption times.
Comput. Oper. Res., 2022

Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems.
Comput. Oper. Res., 2022

Knapsack problems - An overview of recent advances. Part I: Single knapsack problems.
Comput. Oper. Res., 2022

Optimization over time of reliable 5G-RAN with network function migrations.
Comput. Networks, 2022

Metaheuristic Algorithms for UAV Trajectory Optimization in Mobile Networks.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018).
Eur. J. Oper. Res., 2021

An Integer Linear Programming model for integrated train stop planning and timetabling with time-dependent passenger demand.
Comput. Oper. Res., 2021

Scalable Multi-objective Optimization of Reliable Latency-constrained Optical Transport Networks.
Proceedings of the 17th International Conference on the Design of Reliable Communication Networks, 2021

2020
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times.
Eur. J. Oper. Res., 2020

Unmanned Aerial Base Stations for NB-IoT: Trajectory Design and Performance Analysis.
Proceedings of the 31st IEEE Annual International Symposium on Personal, 2020

2019
An Effective Peak Period Heuristic for Railway Rolling Stock Planning.
Transp. Sci., 2019

A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities.
Eur. J. Oper. Res., 2019

2018
Robust Train Timetabling and Stop Planning with Uncertain Passenger Demand.
Electron. Notes Discret. Math., 2018

Preface.
Electron. Notes Discret. Math., 2018

Path Optimization for Unmanned Aerial Base Stations with Limited Radio Resources.
Proceedings of the 29th IEEE Annual International Symposium on Personal, 2018

2017
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem.
Transp. Sci., 2017

A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph.
INFORMS J. Comput., 2017

A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs.
Eur. J. Oper. Res., 2017

2016
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions.
Transp. Sci., 2016

Single-commodity robust network design with finite and Hose demand sets.
Math. Program., 2016

Timetable Optimization for High-Speed Trains at Chinese Railways.
Electron. Notes Discret. Math., 2016

2015
A tutorial on non-periodic train timetabling and platforming problems.
EURO J. Transp. Logist., 2015

Heuristic Solutions to a Mailroom Inserting Machine Planning Problem.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Single-commodity robust network design problem: Complexity, instances and heuristic solutions.
Eur. J. Oper. Res., 2014

A set-covering based heuristic algorithm for the periodic vehicle routing problem.
Discret. Appl. Math., 2014

2013
On integer polytopes with few nonzero vertices.
Oper. Res. Lett., 2013

Finding cliques of maximum weight on a generalization of permutation graphs.
Optim. Lett., 2013

A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem.
Electron. Notes Discret. Math., 2013

A Lagrangian heuristic for a train-unit assignment problem.
Discret. Appl. Math., 2013

A new lower bound for curriculum-based course timetabling.
Comput. Oper. Res., 2013

A hybrid approach to beam angle optimization in intensity-modulated radiation therapy.
Comput. Oper. Res., 2013

2012
Railway Rolling Stock Planning: Robustness Against Large Disruptions.
Transp. Sci., 2012

A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling.
Transp. Sci., 2012

Nominal and robust train timetabling problems.
Eur. J. Oper. Res., 2012

Models and Algorithms for the Train Unit Assignment Problem.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

A Fast Heuristic Algorithm for the Train Unit Assignment Problem.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2011
A multistart heuristic for the equality generalized traveling salesman problem.
Networks, 2011

2010
Non-cyclic train timetabling and comparability graphs.
Oper. Res. Lett., 2010

Solving a real-world train-unit assignment problem.
Math. Program., 2010

A Heuristic Algorithm for the Train-Unit Assignment Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
Models and algorithms for combinatorial optimization problems arising in railway applications.
4OR, 2009

Robustness in Train Timetabling.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
A column generation approach to train timetabling on a corridor.
4OR, 2008

A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Recoverable Robustness for Railway Rolling Stock Planning.
Proceedings of the ATMOS 2008, 2008


  Loading...