default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Ceselli
Person information
- affiliation: Università degli Studi di Milano, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j51]Michele Barbato
, Alberto Ceselli:
Mathematical programming for simultaneous feature selection and outlier detection under l1 norm. Eur. J. Oper. Res. 316(3): 1070-1084 (2024)- [j50]Michele Barbato, Alberto Ceselli, Giovanni Righini:
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses. J. Sched. 27(4): 393-407 (2024) - [i2]Michele Barbato, Alberto Ceselli, Rosario Messana:
Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget. CoRR abs/2407.17341 (2024) - 2023
- [j49]Christian Quadri, Alberto Ceselli, Gian Paolo Rossi:
Multi-user edge service orchestration based on Deep Reinforcement Learning. Comput. Commun. 203: 30-47 (2023) - [j48]Michele Barbato, Alberto Ceselli, Marco Premoli:
On the impact of resource relocation in facing health emergencies. Eur. J. Oper. Res. 308(1): 422-435 (2023) - [j47]Saverio Basso, Alberto Ceselli:
A data driven Dantzig-Wolfe decomposition framework. Math. Program. Comput. 15(1): 153-194 (2023) - 2022
- [j46]Saverio Basso, Alberto Ceselli:
Distributed asynchronous column generation. Comput. Oper. Res. 146: 105894 (2022) - [j45]Marco Casazza, Alberto Ceselli:
Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks. INFORMS J. Comput. 34(4): 1987-2002 (2022) - [j44]Alberto Ceselli, Lucas Létocart, Emiliano Traversi:
Dantzig-Wolfe reformulations for binary quadratic problems. Math. Program. Comput. 14(1): 85-120 (2022) - [j43]Nour-El-Houda Yellas, Selma Boumerdassi, Alberto Ceselli, Bilal Maaz, Stefano Secci:
Robust Access Point Clustering in Edge Computing Resource Optimization. IEEE Trans. Netw. Serv. Manag. 19(3): 2738-2750 (2022) - 2021
- [j42]Marco Casazza, Alberto Ceselli:
Optimization algorithms for resilient path selection in networks. Comput. Oper. Res. 128: 105191 (2021) - [j41]Marco Casazza, Alberto Ceselli, Roberto Wolfler Calvo:
A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem. Eur. J. Oper. Res. 289(3): 897-911 (2021) - [j40]Alberto Ceselli, Ángel Felipe, M. Teresa Ortuño, Giovanni Righini, Gregorio Tirado:
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies. Oper. Res. Forum 2(1) (2021) - [c19]Nour-El-Houda Yellas, Selma Boumerdassi, Alberto Ceselli, Stefano Secci:
Complexity-Performance Trade-offs in Robust Access Point Clustering for Edge Computing. DRCN 2021: 1-8 - 2020
- [j39]Christian Quadri, Marco Premoli, Alberto Ceselli, Sabrina Gaito, Gian Paolo Rossi:
Optimal Assignment Plan in Sliced Backhaul Networks. IEEE Access 8: 68983-69002 (2020) - [j38]Saverio Basso, Alberto Ceselli, Andrea Tettamanzi:
Random sampling and machine learning to understand good decompositions. Ann. Oper. Res. 284(2): 501-526 (2020) - [c18]Dario Bezzi, Alberto Ceselli, Giovanni Righini:
Automated Tuning of a Column Generation Algorithm. LION 2020: 201-215
2010 – 2019
- 2019
- [j37]Alberto Ceselli, Marco Fiore, Marco Premoli, Stefano Secci:
Optimized assignment patterns in Mobile Edge Cloud networks. Comput. Oper. Res. 106: 246-259 (2019) - [j36]Alberto Ceselli, Roberto Cordone:
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016). Discret. Appl. Math. 253: 1 (2019) - 2018
- [j35]Marco Casazza, Alberto Ceselli, Roberto Wolfler Calvo:
A branch and price approach for the Split Pickup and Split Delivery VRP. Electron. Notes Discret. Math. 69: 189-196 (2018) - [j34]Saverio Basso, Alberto Ceselli:
Computational evaluation of ranking models in an automatic decomposition framework. Electron. Notes Discret. Math. 69: 245-252 (2018) - [j33]Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi:
Mathematical Programming Algorithms for Spatial Cloaking. INFORMS J. Comput. 30(4): 710-723 (2018) - [j32]Marco Casazza, Alberto Ceselli, Daniel Chemla, Frédéric Meunier, Roberto Wolfler Calvo:
The multiple vehicle balancing problem. Networks 72(3): 337-357 (2018) - [c17]Alberto Ceselli, Marco Fiore, Angelo Furno, Marco Premoli, Stefano Secci, Razvan Stanica:
Prescriptive Analytics for MEC Orchestration. Networking 2018: 316-324 - 2017
- [j31]Michail-Alexandros Kourtis, Michael J. McGrath, Georgios Gardikis, Georgios Xilouris, Vincenzo Riccobene, Panagiotis Papadimitriou, Eleni Trouva, Francesco Liberati, Marco Trubian, Josep Batalle, Harilaos Koumaras, David Dietrich, Aurora Ramos, Jordi Ferrer Riera, José Bonnet, Antonio Pietrabissa, Alberto Ceselli, Alessandro Petrini:
T-NOVA: An Open-Source MANO Stack for NFV Infrastructures. IEEE Trans. Netw. Serv. Manag. 14(3): 586-602 (2017) - [j30]Alberto Ceselli, Marco Premoli, Stefano Secci:
Mobile Edge Cloud Network Design Optimization. IEEE/ACM Trans. Netw. 25(3): 1818-1831 (2017) - [c16]Saverio Basso, Alberto Ceselli:
Asynchronous Column Generation. ALENEX 2017: 197-206 - 2016
- [j29]Marco Casazza, Alberto Ceselli:
Exactly solving packing problems with fragmentation. Comput. Oper. Res. 75: 202-213 (2016) - [j28]Alberto Ceselli, Roberto Cordone, Giovanni Righini:
Preface. Electron. Notes Discret. Math. 55: 1-3 (2016) - [j27]Alberto Ceselli, Marco Premoli, Stefano Secci:
Heuristics for static cloudlet location. Electron. Notes Discret. Math. 55: 21-24 (2016) - [j26]Marco Casazza, Alberto Ceselli:
Column generation for the variable cost and size bin packing problem with fragmentation. Electron. Notes Discret. Math. 55: 61-64 (2016) - [j25]Paolo Gianessi, Alberto Ceselli, Lucas Létocart, Roberto Wolfler Calvo:
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. Electron. Notes Discret. Math. 55: 93-96 (2016) - [c15]Jordi Ferrer Riera, Josep Batalle, José Bonnet, Miguel Dias, Michael J. McGrath, Giuseppe Petralia, Francesco Liberati, Alessandro Giuseppi, Antonio Pietrabissa, Alberto Ceselli, Alessandro Petrini, Marco Trubian, Panagiotis Papadimitriou, David Dietrich, Aurora Ramos, Javier Melian, George Xilouris, Akis Kourtis, Tassos Kourtis, Evangelos K. Markakis:
TeNOR: Steps towards an orchestration platform for multi-PoP NFV deployment. NetSoft 2016: 243-250 - [c14]Evangelia Tsiontsiou, Bernardetta Addis, Ye-Qiong Song, Alberto Ceselli:
Optimal Probabilistic Energy-Aware Routing for Duty-Cycled Wireless Sensor Networks. NTMS 2016: 1-7 - [c13]Alberto Ceselli, Marco Premoli:
Towards Mathematical Programming Methods for Predicting User Mobility in Mobile Networks. OR 2016: 45-50 - 2015
- [j24]Martin Bergner, Alberto Caprara, Alberto Ceselli, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149(1-2): 391-424 (2015) - [c12]Alberto Ceselli, Marco Premoli, Stefano Secci:
Cloudlet network design optimization. Networking 2015: 1-9 - [c11]Alberto Ceselli, Marco Cremonini, Simeone Cristofaro:
Models and Methods for the Analysis of the Diffusion of Skills in Social Networks. OR 2015: 475-481 - [i1]Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi:
Mathematical programming algorithms for spatial cloaking. CTW 2015: 217-220 - 2014
- [j23]Marco Casazza, Alberto Ceselli:
Mathematical programming algorithms for bin packing problems with item fragmentation. Comput. Oper. Res. 46: 1-11 (2014) - [j22]Alberto Ceselli, Fabio Colombo, Roberto Cordone, Marco Trubian:
Employee workload balancing by graph partitioning. Discret. Appl. Math. 165: 112-129 (2014) - [j21]Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi:
Combined location and routing problems for drug distribution. Discret. Appl. Math. 165: 130-145 (2014) - [j20]Alberto Ceselli, Fabio Colombo, Roberto Cordone:
Balanced compact clustering for efficient range queries in metric spaces. Discret. Appl. Math. 169: 43-67 (2014) - [j19]Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2): 171-197 (2014) - [j18]Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi:
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm. Networks 64(4): 282-291 (2014) - [c10]Marco Casazza, Alberto Ceselli, Lucas Létocart:
Optimizing Time Slot Allocation in Single Operator Home Delivery Problems. OR 2014: 91-97 - [c9]Alberto Ceselli, Alberto Gelmini, Giovanni Righini, Andrea Taverna:
Mathematical Programming bounds for Large-Scale Unit Commitment Problems in Medium-Term Energy System Simulations. SCOR 2014: 63-75 - 2013
- [j17]Bernardetta Addis, Giuliana Carello, Alberto Ceselli:
Combining very large scale and ILP based neighborhoods for a two-level location problem. Eur. J. Oper. Res. 231(3): 535-546 (2013) - [j16]Edoardo Amaldi, Kanika Dhyani, Alberto Ceselli:
Column Generation for the Minimum Hyperplanes Clustering Problem. INFORMS J. Comput. 25(3): 446-460 (2013) - [j15]Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi:
Modeling and solving profitable location and distribution problems. Optim. Lett. 7(7): 1471-1480 (2013) - 2012
- [j14]Marco Casazza, Alberto Ceselli, Marc Nunkesser:
Efficient algorithms for the double traveling salesman problem with multiple stacks. Comput. Oper. Res. 39(5): 1044-1053 (2012) - [j13]Alberto Ceselli, Sandro Luciano Fornili, Giovanni Righini:
Algorithms for the Design of Maximum Hydropathic Complementarity Molecules. J. Comput. Biol. 19(3): 261-270 (2012) - [j12]Bernardetta Addis, Giuliana Carello, Alberto Ceselli:
Exactly solving a two-level location problem with modular node capacities. Networks 59(1): 161-180 (2012) - 2011
- [c8]Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi:
Combined Location and Routing Problems in Drug Distribution. CTW 2011: 113-117 - 2010
- [j11]Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Ann. Oper. Res. 179(1): 221-241 (2010) - [c7]Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows. CTW 2010: 25-28 - [c6]Alberto Ceselli, Roberto Cordone, Yari Melzani, Giovanni Righini:
Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints. CTW 2010: 37-41
2000 – 2009
- 2009
- [j10]Alberto Ceselli, Federico Liberatore, Giovanni Righini:
A computational evaluation of a general branch-and-price framework for capacitated network location problems. Ann. Oper. Res. 167(1): 209-251 (2009) - [j9]Alberto Ceselli, Giovanni Righini, Matteo Salani:
A Column Generation Algorithm for a Rich Vehicle-Routing Problem. Transp. Sci. 43(1): 56-69 (2009) - [c5]Marco Casazza, Alberto Ceselli, Marc Nunkesser:
Efficient Algorithms for the Double Traveling Salesman Problem with Multiple Stacks. CTW 2009: 7-10 - [c4]Alberto Ceselli, Roberto Cordone, Marco Cremonini:
Balanced Clustering for Efficient Detection of Scientific Plagiarism. CTW 2009: 163-170 - 2008
- [j8]Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the two-dimensional level strip packing problem. 4OR 6(4): 361-374 (2008) - [j7]Alberto Ceselli, Giovanni Righini:
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem. Oper. Res. 56(2): 425-436 (2008) - [j6]Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, Heiko Schilling:
Optimizing the Cargo Express Service of Swiss Federal Railways. Transp. Sci. 42(4): 450-465 (2008) - [c3]Edoardo Amaldi, Alberto Ceselli, Kanika Dhyani:
Column Generation for the Minimum Hyperplanes Clustering Problem. CTW 2008: 162-166 - 2007
- [c2]Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. CTW 2007: 23-27 - [c1]Stefano Secci, Alberto Ceselli, Federico Malucelli, Achille Pattavina, Brunilde Sansò:
Direct optimal design of a quasi-regular composite-star core network. DRCN 2007: 1-8 - 2006
- [j5]Alberto Ceselli, Giovanni Righini:
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem. Oper. Res. 54(6): 1172-1184 (2006) - [j4]Alberto Ceselli, Giovanni Righini:
An optimization algorithm for a penalized knapsack problem. Oper. Res. Lett. 34(4): 394-404 (2006) - 2005
- [b1]Alberto Ceselli:
Branch-and-price algorithms for partitioning problems. University of Milan, Italy, 2005 - [j3]Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the capacitated p-median problem. Networks 45(3): 125-142 (2005) - [j2]Alberto Ceselli, Ernesto Damiani, Sabrina De Capitani di Vimercati, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati:
Modeling and assessing inference exposure in encrypted databases. ACM Trans. Inf. Syst. Secur. 8(1): 119-152 (2005) - 2003
- [j1]Alberto Ceselli:
Two exact algorithms for the capacitated p-median problem. 4OR 1(4): 319-340 (2003)
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 21:41 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:
