Остановите войну!
for scientists:
default search action
Valentina Cacchiani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Valentina Cacchiani, Matthias Müller-Hannemann, Federico Perea Rojas-Marcos:
Guest Editorial to the Special Issue Public Transport Optimization: From Theory to Practice. Oper. Res. Forum 5(3): 73 (2024) - 2023
- [j35]Valentina Cacchiani, Carlos Contreras Bolton, Luis Miguel Escobar-Falcón, Paolo Toth:
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems. Int. Trans. Oper. Res. 30(2): 655-687 (2023) - 2022
- [j34]Nicola Di Cicco, Federico Tonini, Valentina Cacchiani, Carla Raffaelli:
Optimization over time of reliable 5G-RAN with network function migrations. Comput. Networks 215: 109216 (2022) - [j33]Gert-Jaap Polinder, Valentina Cacchiani, Marie Schmidt, Dennis Huisman:
An iterative heuristic for passenger-centric train timetabling with integrated adaption times. Comput. Oper. Res. 142: 105740 (2022) - [j32]Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello:
Knapsack problems - An overview of recent advances. Part I: Single knapsack problems. Comput. Oper. Res. 143: 105692 (2022) - [j31]Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello:
Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143: 105693 (2022) - [c12]Valentina Cacchiani, Sara Ceschia, Silvia Mignardi, Chiara Buratti:
Metaheuristic Algorithms for UAV Trajectory Optimization in Mobile Networks. MIC 2022: 30-44 - 2021
- [j30]Jianguo Qi, Valentina Cacchiani, Lixing Yang, Chuntian Zhang, Zhen Di:
An Integer Linear Programming model for integrated train stop planning and timetabling with time-dependent passenger demand. Comput. Oper. Res. 136: 105484 (2021) - [j29]Valentina Cacchiani, Enrico Malaguti, Paolo Toth:
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018). Eur. J. Oper. Res. 289(3): 807-808 (2021) - [c11]Nicola Di Cicco, Valentina Cacchiani, Carla Raffaelli:
Scalable Multi-objective Optimization of Reliable Latency-constrained Optical Transport Networks. DRCN 2021: 1-6 - 2020
- [j28]Valentina Cacchiani, Carlos Contreras Bolton, Paolo Toth:
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times. Eur. J. Oper. Res. 283(3): 825-843 (2020) - [c10]Silvia Mignardi, Konstantin Mikhaylov, Valentina Cacchiani, Roberto Verdone, Chiara Buratti:
Unmanned Aerial Base Stations for NB-IoT: Trajectory Design and Performance Analysis. PIMRC 2020: 1-6
2010 – 2019
- 2019
- [j27]Andrea Bettinelli, Valentina Cacchiani, Teodor Gabriel Crainic, Daniele Vigo:
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. 279(3): 824-839 (2019) - [j26]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
An Effective Peak Period Heuristic for Railway Rolling Stock Planning. Transp. Sci. 53(3): 746-762 (2019) - [e1]Valentina Cacchiani, Alberto Marchetti-Spaccamela:
19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2019, September 12-13, 2019, Munich, Germany. OASIcs 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-128-3 [contents] - 2018
- [j25]Valentina Cacchiani, Enrico Malaguti, Antonio Mauttone, Paolo Toth:
Preface. Electron. Notes Discret. Math. 69: 1-3 (2018) - [j24]Jianguo Qi, Valentina Cacchiani, Lixing Yang:
Robust Train Timetabling and Stop Planning with Uncertain Passenger Demand. Electron. Notes Discret. Math. 69: 213-220 (2018) - [c9]Silvia Mignardi, Chiara Buratti, Valentina Cacchiani, Roberto Verdone:
Path Optimization for Unmanned Aerial Base Stations with Limited Radio Resources. PIMRC 2018: 328-332 - 2017
- [j23]Valentina Cacchiani, Claudia D'Ambrosio:
A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs. Eur. J. Oper. Res. 260(3): 920-933 (2017) - [j22]Andrea Bettinelli, Valentina Cacchiani, Enrico Malaguti:
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph. INFORMS J. Comput. 29(3): 457-473 (2017) - [j21]Valentina Cacchiani, Juan José Salazar González:
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem. Transp. Sci. 51(1): 250-268 (2017) - 2016
- [j20]Valentina Cacchiani, Feng Jiang, Paolo Toth:
Timetable Optimization for High-Speed Trains at Chinese Railways. Electron. Notes Discret. Math. 55: 29-32 (2016) - [j19]Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt:
Single-commodity robust network design with finite and Hose demand sets. Math. Program. 157(1): 297-342 (2016) - [j18]Lucas P. Veelenturf, Martin Philip Kidd, Valentina Cacchiani, Leo G. Kroon, Paolo Toth:
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions. Transp. Sci. 50(3): 841-862 (2016) - 2015
- [j17]Valentina Cacchiani, Laura Galli, Paolo Toth:
A tutorial on non-periodic train timetabling and platforming problems. EURO J. Transp. Logist. 4(3): 285-320 (2015) - [i1]Andrea Bettinelli, Sandro Bosio, Valentina Cacchiani:
Heuristic Solutions to a Mailroom Inserting Machine Planning Problem. CTW 2015: 77-80 - 2014
- [j16]Valentina Cacchiani, Vera C. Hemmelmayr, Fabien Tricoire:
A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discret. Appl. Math. 163: 53-64 (2014) - [j15]Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Single-commodity robust network design problem: Complexity, instances and heuristic solutions. Eur. J. Oper. Res. 238(3): 711-723 (2014) - 2013
- [j14]Dimitris Bertsimas, Valentina Cacchiani, David Craft, Omid Nohadani:
A hybrid approach to beam angle optimization in intensity-modulated radiation therapy. Comput. Oper. Res. 40(9): 2187-2197 (2013) - [j13]Valentina Cacchiani, Alberto Caprara, Roberto Roberti, Paolo Toth:
A new lower bound for curriculum-based course timetabling. Comput. Oper. Res. 40(10): 2466-2477 (2013) - [j12]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Lagrangian heuristic for a train-unit assignment problem. Discret. Appl. Math. 161(12): 1707-1718 (2013) - [j11]Valentina Cacchiani, Juan José Salazar González:
A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem. Electron. Notes Discret. Math. 41: 391-398 (2013) - [j10]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Finding cliques of maximum weight on a generalization of permutation graphs. Optim. Lett. 7(2): 289-296 (2013) - [j9]Valentina Cacchiani, Alberto Caprara, Gábor Maróti, Paolo Toth:
On integer polytopes with few nonzero vertices. Oper. Res. Lett. 41(1): 74-77 (2013) - 2012
- [j8]Valentina Cacchiani, Paolo Toth:
Nominal and robust train timetabling problems. Eur. J. Oper. Res. 219(3): 727-737 (2012) - [j7]Valentina Cacchiani, Alberto Caprara, Matteo Fischetti:
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. Transp. Sci. 46(1): 124-133 (2012) - [j6]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth:
Railway Rolling Stock Planning: Robustness Against Large Disruptions. Transp. Sci. 46(2): 217-232 (2012) - [c8]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Fast Heuristic Algorithm for the Train Unit Assignment Problem. ATMOS 2012: 1-9 - [c7]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Models and Algorithms for the Train Unit Assignment Problem. ISCO 2012: 24-35 - [c6]Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO 2012: 261-272 - 2011
- [j5]Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth:
A multistart heuristic for the equality generalized traveling salesman problem. Networks 57(3): 231-239 (2011) - 2010
- [j4]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a real-world train-unit assignment problem. Math. Program. 124(1-2): 207-231 (2010) - [j3]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38(3): 179-184 (2010) - [c5]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Heuristic Algorithm for the Train-Unit Assignment Problem. CTW 2010: 33-36
2000 – 2009
- 2009
- [j2]Valentina Cacchiani:
Models and algorithms for combinatorial optimization problems arising in railway applications. 4OR 7(1): 109-112 (2009) - [c4]Valentina Cacchiani, Alberto Caprara, Matteo Fischetti:
Robustness in Train Timetabling. CTW 2009: 171-174 - 2008
- [j1]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A column generation approach to train timetabling on a corridor. 4OR 6(2): 125-142 (2008) - [c3]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti:
Recoverable Robustness for Railway Rolling Stock Planning. ATMOS 2008 - [c2]Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth:
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem. CTW 2008: 136-138 - 2007
- [c1]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a Real-World Train Unit Assignment Problem. ATMOS 2007
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-08-22 19:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint