Marco Premoli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Marco Premoli has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Alberto Ceselli
Dipartimento di Informatica, Università degli Studi di Milano, Milan, Italy
7 shared publications - Giuseppe De Martino
Università degli Studi di Milano
2 shared publications - Michele Barbato
Università degli Studi di Milano
2 shared publications - Stefano Secci
CEDRIC, CNAM, Paris, France
2 shared publications - Sahar Hoteit
Universit Paris-Saclay, CNRS, CentraleSuplec, Laboratoire des signaux et systmes, Gif-sur-Yvette, France
1 shared publication
Latest Publications
- 31 January 2025
- Published by Springer Nature
- p. 318-327
On the Optimization of the Picking of Goods-on-Hangers in Slick Rail Systems
- 31 January 2025
- Published by Springer Nature
- p. 318-327
On the Optimization of the Picking of Goods-on-Hangers in Slick Rail Systems
- 25 November 2024
- Published by Springer Nature in Journal of Intelligent Manufacturing
- p. 1-17
Identification of sensors in smart manufacturing via mutually exclusive multiple time series classification
- 25 November 2024
- Published by Springer Nature in Journal of Intelligent Manufacturing
- p. 1-17
Identification of sensors in smart manufacturing via mutually exclusive multiple time series classification
- Open Access
- 6 April 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-10
On good encodings for quantum annealer and digital optimization solvers
Several optimization solvers inspired by quantum annealing have been recently developed, either running on actual quantum hardware or simulating it on traditional digital computers. Industry and academics look at their potential in solving hard combinatorial optimization problems. Formally, they provide heuristic solutions for Ising models, which are equivalent to quadratic unconstrained binary optimization (QUBO). Constraints on solutions feasibility need to be properly encoded. We experiment on different ways of performing such an encoding. As benchmark we consider the cardinality constrained quadratic knapsack problem (CQKP), a minimal extension of QUBO with one inequality and one equality constraint. We consider different strategies of constraints penalization and variables encoding. We compare three QUBO solvers: quantum annealing on quantum hardware (D-Wave Advantage), probabilistic algorithms on digital hardware and mathematical programming solvers. We analyze their QUBO resolution quality and time, and the persistence values extracted in the quantum annealing sampling process. Our results show that a linear penalization of CQKP inequality improves current best practice. Furthermore, using such a linear penalization, persistence values produced by quantum hardware in a generic way allow to match a specific CQKP metric from literature. They are therefore suitable for general purpose variable fixing in core algorithms for combinatorial optimization.
- 6 April 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-10
Open AccessOn good encodings for quantum annealer and digital optimization solvers
Several optimization solvers inspired by quantum annealing have been recently developed, either running on actual quantum hardware or simulating it on traditional digital computers. Industry and academics look at their potential in solving hard combinatorial optimization problems. Formally, they provide heuristic solutions for Ising models, which are equivalent to quadratic unconstrained binary optimization (QUBO). Constraints on solutions feasibility need to be properly encoded. We experiment on different ways of performing such an encoding. As benchmark we consider the cardinality constrained quadratic knapsack problem (CQKP), a minimal extension of QUBO with one inequality and one equality constraint. We consider different strategies of constraints penalization and variables encoding. We compare three QUBO solvers: quantum annealing on quantum hardware (D-Wave Advantage), probabilistic algorithms on digital hardware and mathematical programming solvers. We analyze their QUBO resolution quality and time, and the persistence values extracted in the quantum annealing sampling process. Our results show that a linear penalization of CQKP inequality improves current best practice. Furthermore, using such a linear penalization, persistence values produced by quantum hardware in a generic way allow to match a specific CQKP metric from literature. They are therefore suitable for general purpose variable fixing in core algorithms for combinatorial optimization.
- 17 November 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 308 (1) , 422-435
On the impact of resource relocation in facing health emergencies
- 17 November 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 308 (1) , 422-435
On the impact of resource relocation in facing health emergencies
- Open Access
- 1 January 2019
- Published by Springer Nature
- p. 127-137
Evaluating Automated Storage and Retrieval System Policies with Simulation and Optimization
- 1 January 2019
- Published by Springer Nature
- p. 127-137
Open AccessEvaluating Automated Storage and Retrieval System Policies with Simulation and Optimization
- 21 July 2017
- Published by Springer Nature in Operations Research Proceedings
- p. 45-50
Towards Mathematical Programming Methods for Predicting User Mobility in Mobile Networks
- 21 July 2017
- Published by Springer Nature in Operations Research Proceedings
- p. 45-50
Towards Mathematical Programming Methods for Predicting User Mobility in Mobile Networks
- Open Access
- 8 July 2017
- Published by Springer Nature in Annals of Telecommunications
- Vol. 72 (11-12) , 743-754
Crowded spot estimator for urban cellular networks
- 8 July 2017
- Published by Springer Nature in Annals of Telecommunications
- Vol. 72 (11-12) , 743-754
Open AccessCrowded spot estimator for urban cellular networks
- Open Access
- 1 November 2016
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 55, 21-24
Heuristics for static cloudlet location
- 1 November 2016
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 55, 21-24
Open AccessHeuristics for static cloudlet location