default search action
Laura Galli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j29]Laura Galli
, Silvano Martello, Carlos Rodrigo Rey Barra, Paolo Toth
The quadratic knapsack problem with setup. Comput. Oper. Res. 173: 106873 (2025) - 2024
- [j28]Laura Galli
On upper bounds for the multiple knapsack assignment problem. Oper. Res. Lett. 54: 107104 (2024) - [j27]Matteo Bonato
A Digital Platform for Home-Based Exercise Prescription for Older People with Sarcopenia. Sensors 24(15): 4788 (2024) - 2023
- [j26]Laura Galli
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. Discret. Appl. Math. 335: 36-51 (2023) - [j25]Matteo Bonato
Failure of Digital Device Performance in Monitoring Physical Exercise in a Pilot Study in Sedentary Persons with HIV. Sensors 23(23): 9461 (2023) - 2022
- [j24]Matteo Andreozzi
A MILP approach to DRAM access worst-case analysis. Comput. Oper. Res. 143: 105774 (2022) - 2021
- [j23]Laura Galli, Adam N. Letchford
Valid inequalities for quadratic optimisation with domain constraints. Discret. Optim. 41: 100661 (2021) - [j22]Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth:
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 291(3): 871-882 (2021) - [j21]Laura Galli
A separation algorithm for the simple plant location problem. Oper. Res. Lett. 49(4): 610-615 (2021)
2010 – 2019
- 2018
- [j20]Antonio Frangioni
Towards Robust Admission Control in Delay-Constrained Routing Problems. Electron. Notes Discret. Math. 69: 45-52 (2018) - [j19]Laura Galli, Adam N. Letchford
New valid inequalities and facets for the Simple Plant Location Problem. Eur. J. Oper. Res. 269(3): 824-833 (2018) - [j18]Giovanni Nardini
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G. J. Netw. Comput. Appl. 106: 1-16 (2018) - [j17]Laura Galli, Adam N. Letchford
A binarisation heuristic for non-convex quadratic programming with box constraints. Oper. Res. Lett. 46(5): 529-533 (2018) - [c7]Giovanni Nardini
Minimizing Power Consumption in Virtualized Cellular Networks. VTC Spring 2018: 1-6 - 2017
- [j16]Antonio Frangioni
QoS routing with worst-case delay constraints: Models, algorithms and performance analysis. Comput. Commun. 103: 104-115 (2017) - [j15]Antonio Frangioni
Delay-constrained routing problems: Accurate scheduling models and admission control. Comput. Oper. Res. 81: 67-77 (2017) - [j14]Laura Galli, Adam N. Letchford
On the Lovász theta function and some variants. Discret. Optim. 25: 159-174 (2017) - [c6]Niccolo Iardella, Giovanni Nardini
Flexible dynamic coordinated scheduling in virtual-RAN deployments. ICC Workshops 2017: 126-131 - 2015
- [j13]Antonio Frangioni
Optimal Joint Path Computation and Rate Allocation for Real-time Traffic. Comput. J. 58(6): 1416-1430 (2015) - [j12]Valentina Cacchiani
A tutorial on non-periodic train timetabling and platforming problems. EURO J. Transp. Logist. 4(3): 285-320 (2015) - [j11]Antonio Frangioni
Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models. J. Optim. Theory Appl. 164(3): 1051-1077 (2015) - 2014
- [j10]Alberto Caprara, Laura Galli, Sebastian Stiller, Paolo Toth:
Delay-Robust Event Scheduling. Oper. Res. 62(2): 274-283 (2014) - [j9]Laura Galli, Adam N. Letchford
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs. Optim. Lett. 8(4): 1213-1224 (2014) - 2012
- [j8]Laura Galli, Konstantinos Kaparis
Complexity results for the gap inequalities for the max-cut problem. Oper. Res. Lett. 40(3): 149-152 (2012) - [j7]Valentina Cacchiani
Railway Rolling Stock Planning: Robustness Against Large Disruptions. Transp. Sci. 46(2): 217-232 (2012) - [c5]Laura Galli, Konstantinos Kaparis, Adam N. Letchford
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. ISCO 2012: 178-188 - 2011
- [j6]Laura Galli:
Combinatorial and robust optimisation models and algorithms for railway applications. 4OR 9(2): 215-218 (2011) - [j5]Laura Galli, Konstantinos Kaparis
Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39(5): 297-300 (2011) - [j4]Alberto Caprara, Laura Galli, Paolo Toth:
Solution of the Train Platforming Problem. Transp. Sci. 45(2): 246-257 (2011) - 2010
- [j3]Zahra Naji Azimi
An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2): 290-300 (2010) - [j2]Laura Galli, Adam N. Letchford
Small bipartite subgraph polytopes. Oper. Res. Lett. 38(5): 337-340 (2010) - [c4]Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth:
Robust Train Routing and Online Re-scheduling. ATMOS 2010: 24-33 - [c3]Laura Galli, Sebastian Stiller:
Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. ESA (1) 2010: 338-349
2000 – 2009
- 2008
- [c2]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti:
Recoverable Robustness for Railway Rolling Stock Planning. ATMOS 2008 - 2007
- [c1]Alberto Caprara, Laura Galli, Paolo Toth:
Solution of the Train Platforming Problem. ATMOS 2007 - 2002
- [j1]F. M. Moresco, Massimiliano Dieci
In Vivo Serotonin 5HT2A Receptor Binding and Personality Traits in Healthy Subjects: A Positron Emission Tomography Study. NeuroImage 17(3): 1470-1478 (2002)
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-12-10 20:48 CET 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: