Alberto Ceselli

Orcid: 0000-0002-0983-2706

Affiliations:
  • Università degli Studi di Milano, Italy


According to our database1, Alberto Ceselli authored at least 68 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

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
On the impact of resource relocation in facing health emergencies.
Eur. J. Oper. Res., July, 2023

Multi-user edge service orchestration based on Deep Reinforcement Learning.
Comput. Commun., April, 2023

A data driven Dantzig-Wolfe decomposition framework.
Math. Program. Comput., March, 2023

2022
Robust Access Point Clustering in Edge Computing Resource Optimization.
IEEE Trans. Netw. Serv. Manag., 2022

Dantzig-Wolfe reformulations for binary quadratic problems.
Math. Program. Comput., 2022

Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks.
INFORMS J. Comput., 2022

Distributed asynchronous column generation.
Comput. Oper. Res., 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

Optimization algorithms for resilient path selection in networks.
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
Random sampling and machine learning to understand good decompositions.
Ann. Oper. Res., 2020

Optimal Assignment Plan in Sliced Backhaul Networks.
IEEE Access, 2020

Automated Tuning of a Column Generation Algorithm.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016).
Discret. Appl. Math., 2019

Optimized assignment patterns in Mobile Edge Cloud networks.
Comput. Oper. Res., 2019

2018
The multiple vehicle balancing problem.
Networks, 2018

Mathematical Programming Algorithms for Spatial Cloaking.
INFORMS J. Comput., 2018

A branch and price approach for the Split Pickup and Split Delivery VRP.
Electron. Notes Discret. Math., 2018

Computational evaluation of ranking models in an automatic decomposition framework.
Electron. Notes Discret. Math., 2018

Prescriptive Analytics for MEC Orchestration.
Proceedings of the 2018 IFIP Networking Conference and Workshops, 2018

2017
Mobile Edge Cloud Network Design Optimization.
IEEE/ACM Trans. Netw., 2017

T-NOVA: An Open-Source MANO Stack for NFV Infrastructures.
IEEE Trans. Netw. Serv. Manag., 2017

Asynchronous Column Generation.
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

Heuristics for static cloudlet location.
Electron. Notes Discret. Math., 2016

Preface.
Electron. Notes Discret. Math., 2016

Column generation for the variable cost and size bin packing problem with fragmentation.
Electron. Notes Discret. Math., 2016

Exactly solving packing problems with fragmentation.
Comput. Oper. Res., 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

Optimal Probabilistic Energy-Aware Routing for Duty-Cycled Wireless Sensor Networks.
Proceedings of the 8th IFIP International Conference on New Technologies, 2016


2015
Automatic Dantzig-Wolfe reformulation of mixed integer programs.
Math. Program., 2015

Models and Methods for the Analysis of the Diffusion of Skills in Social Networks.
Proceedings of the Operations Research Proceedings 2015, 2015

Cloudlet network design optimization.
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

Combined location and routing problems for drug distribution.
Discret. Appl. Math., 2014

Employee workload balancing by graph partitioning.
Discret. Appl. Math., 2014

Balanced compact clustering for efficient range queries in metric spaces.
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

Optimizing Time Slot Allocation in Single Operator Home Delivery Problems.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Modeling and solving profitable location and distribution problems.
Optim. Lett., 2013

Column Generation for the Minimum Hyperplanes Clustering Problem.
INFORMS J. Comput., 2013

Combining very large scale and ILP based neighborhoods for a two-level location problem.
Eur. J. Oper. Res., 2013

2012
Exactly solving a two-level location problem with modular node capacities.
Networks, 2012

Algorithms for the Design of Maximum Hydropathic Complementarity Molecules.
J. Comput. Biol., 2012

Efficient algorithms for the double traveling salesman problem with multiple stacks.
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 Column Generation Algorithm for a Rich Vehicle-Routing Problem.
Transp. Sci., 2009

A computational evaluation of a general branch-and-price framework for capacitated network location problems.
Ann. Oper. Res., 2009

Balanced Clustering for Efficient Detection of Scientific Plagiarism.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Optimizing the Cargo Express Service of Swiss Federal Railways.
Transp. Sci., 2008

An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem.
Oper. Res., 2008

A branch-and-price algorithm for the two-dimensional level strip packing problem.
4OR, 2008

2007
Direct optimal design of a quasi-regular composite-star core network.
Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006
An optimization algorithm for a penalized knapsack problem.
Oper. Res. Lett., 2006

A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem.
Oper. Res., 2006

2005
Branch-and-price algorithms for partitioning problems.
PhD thesis, 2005

Modeling and assessing inference exposure in encrypted databases.
ACM Trans. Inf. Syst. Secur., 2005

A branch-and-price algorithm for the capacitated <i>p</i>-median problem.
Networks, 2005

2003
Two exact algorithms for the capacitated p-median problem.
4OR, 2003


  Loading...