Alberto Ceselli
Orcid: 0000-0002-0983-2706Affiliations:
- Università degli Studi di Milano, Italy
According to our database1,
Alberto Ceselli
authored at least 68 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses.
J. Sched., August, 2024
Mathematical programming for simultaneous feature selection and outlier detection under l1 norm.
Eur. J. Oper. Res., 2024
Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget.
CoRR, 2024
2023
Eur. J. Oper. Res., July, 2023
Comput. Commun., April, 2023
Math. Program. Comput., March, 2023
2022
IEEE Trans. Netw. Serv. Manag., 2022
Math. Program. Comput., 2022
Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks.
INFORMS J. Comput., 2022
2021
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies.
Oper. Res. Forum, 2021
A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem.
Eur. J. Oper. Res., 2021
Comput. Oper. Res., 2021
Complexity-Performance Trade-offs in Robust Access Point Clustering for Edge Computing.
Proceedings of the 17th International Conference on the Design of Reliable Communication Networks, 2021
2020
Ann. Oper. Res., 2020
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020
2019
Discret. Appl. Math., 2019
Comput. Oper. Res., 2019
2018
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
Proceedings of the 2018 IFIP Networking Conference and Workshops, 2018
2017
IEEE Trans. Netw. Serv. Manag., 2017
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017
2016
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities.
Electron. Notes Discret. Math., 2016
Column generation for the variable cost and size bin packing problem with fragmentation.
Electron. Notes Discret. Math., 2016
Towards Mathematical Programming Methods for Predicting User Mobility in Mobile Networks.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016
Proceedings of the 8th IFIP International Conference on New Technologies, 2016
Proceedings of the IEEE NetSoft Conference and Workshops, 2016
2015
Math. Program., 2015
Proceedings of the Operations Research Proceedings 2015, 2015
Proceedings of the 14th IFIP Networking Conference, 2015
2014
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm.
Networks, 2014
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows.
Math. Program. Comput., 2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
Mathematical programming algorithms for bin packing problems with item fragmentation.
Comput. Oper. Res., 2014
Mathematical Programming bounds for Large-Scale Unit Commitment Problems in Medium-Term Energy System Simulations.
Proceedings of the 4th Student Conference on Operational Research, 2014
Proceedings of the Operations Research Proceedings 2014, 2014
2013
Optim. Lett., 2013
INFORMS J. Comput., 2013
Combining very large scale and ILP based neighborhoods for a two-level location problem.
Eur. J. Oper. Res., 2013
2012
Networks, 2012
J. Comput. Biol., 2012
Comput. Oper. Res., 2012
2010
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint.
Ann. Oper. Res., 2010
Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
A computational evaluation of a general branch-and-price framework for capacitated network location problems.
Ann. Oper. Res., 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Oper. Res., 2008
4OR, 2008
2007
Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007
2006
Oper. Res., 2006
2005
ACM Trans. Inf. Syst. Secur., 2005
Networks, 2005
2003