Laura Galli

Orcid: 0000-0002-5801-9439

According to our database1, Laura Galli authored at least 32 papers between 2002 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Failure of Digital Device Performance in Monitoring Physical Exercise in a Pilot Study in Sedentary Persons with HIV.
Sensors, December, 2023

Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem.
Discret. Appl. Math., August, 2023

2022
A MILP approach to DRAM access worst-case analysis.
Comput. Oper. Res., 2022

2021
A separation algorithm for the simple plant location problem.
Oper. Res. Lett., 2021

Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2021

Valid inequalities for quadratic optimisation with domain constraints.
Discret. Optim., 2021

2018
A binarisation heuristic for non-convex quadratic programming with box constraints.
Oper. Res. Lett., 2018

Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G.
J. Netw. Comput. Appl., 2018

New valid inequalities and facets for the Simple Plant Location Problem.
Eur. J. Oper. Res., 2018

Towards Robust Admission Control in Delay-Constrained Routing Problems.
Electron. Notes Discret. Math., 2018

Minimizing Power Consumption in Virtualized Cellular Networks.
Proceedings of the 87th IEEE Vehicular Technology Conference, 2018

2017
On the Lovász theta function and some variants.
Discret. Optim., 2017

Delay-constrained routing problems: Accurate scheduling models and admission control.
Comput. Oper. Res., 2017

QoS routing with worst-case delay constraints: Models, algorithms and performance analysis.
Comput. Commun., 2017

Flexible dynamic coordinated scheduling in virtual-RAN deployments.
Proceedings of the 2017 IEEE International Conference on Communications Workshops, 2017

2015
Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models.
J. Optim. Theory Appl., 2015

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

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic.
Comput. J., 2015

2014
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs.
Optim. Lett., 2014

Delay-Robust Event Scheduling.
Oper. Res., 2014

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

Complexity results for the gap inequalities for the max-cut problem.
Oper. Res. Lett., 2012

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Solution of the Train Platforming Problem.
Transp. Sci., 2011

Gap inequalities for non-convex mixed-integer quadratic programs.
Oper. Res. Lett., 2011

Combinatorial and robust optimisation models and algorithms for railway applications.
4OR, 2011

2010
Small bipartite subgraph polytopes.
Oper. Res. Lett., 2010

An electromagnetism metaheuristic for the unicost set covering problem.
Eur. J. Oper. Res., 2010

Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems.
Proceedings of the Algorithms, 2010

Robust Train Routing and Online Re-scheduling.
Proceedings of the ATMOS 2010, 2010

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

2002
In Vivo Serotonin 5HT<sub>2A</sub> Receptor Binding and Personality Traits in Healthy Subjects: A Positron Emission Tomography Study.
NeuroImage, 2002


  Loading...