Andrea Bettinelli
Andrea Bettinelli has a total of 30 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
5 shared publications Giovanni Righini
Dipartimento di Informatica, Università degli Studi di Milano, Milan, Italy
3 shared publications- Daniele Vigo
University of Bologna
2 shared publications - Giovanni Righini
Università degli Studi di Milano
2 shared publications - Leo Liberti
LIX CNRS, Ecole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France
2 shared publications - Paolo Toth
DEI University of Bologna Viale Risorgimento 2 Bologna I‐40136 Italy
2 shared publications
Latest Publications
- 1 May 2026
- Published by Springer Nature
- p. 139-153
Long Short-Term Memory Models for Improving Route Planning Acceptance
- 1 May 2026
- Published by Springer Nature
- p. 139-153
Long Short-Term Memory Models for Improving Route Planning Acceptance
- 11 October 2025
- Published by Springer Nature
- p. 145-155
A Mixed-Integer Linear Program to Create the Shifts in a Supermarket
- 11 October 2025
- Published by Springer Nature
- p. 145-155
A Mixed-Integer Linear Program to Create the Shifts in a Supermarket
- 1 August 2017
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 29 (3) , 457-473
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1 knapsack problem, in which a conflict graph describing incompatibilities between items is given. The goal of the KPCG is to select the maximum profit set of compatible items while satisfying the knapsack capacity constraint. We present a new branch-and-bound approach to derive optimal solutions to the KPCG in short computing times. Extensive computational experiments are reported showing that, for instances with graph density of 10% and larger, the proposed method outperforms a state-of-the-art approach and mixed-integer programming formulations tackled through a general purpose solver. The online supplement is available at https://doi.org/10.1287/ijoc.2016.0742 .
- 1 August 2017
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 29 (3) , 457-473
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1 knapsack problem, in which a conflict graph describing incompatibilities between items is given. The goal of the KPCG is to select the maximum profit set of compatible items while satisfying the knapsack capacity constraint. We present a new branch-and-bound approach to derive optimal solutions to the KPCG in short computing times. Extensive computational experiments are reported showing that, for instances with graph density of 10% and larger, the proposed method outperforms a state-of-the-art approach and mixed-integer programming formulations tackled through a general purpose solver. The online supplement is available at https://doi.org/10.1287/ijoc.2016.0742 .
- 20 December 2016
- Published by Springer Nature
- p. 71-87
Decision Support Systems for Energy Production Optimization and Network Design in District Heating Applications
- 20 December 2016
- Published by Springer Nature
- p. 71-87
Decision Support Systems for Energy Production Optimization and Network Design in District Heating Applications
- 15 February 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 3 (5) , 647-657
From a Real Deployment to a Downscaled Testbed: A Methodological Approach
This paper proposes a novel methodology for the spatial downscaling of real-world deployments of wireless networks, running protocols, and/or applications for the Internet of Things (IoT). These networks are often deployed in environments not easily accessible and highly unpredictable, where doing experiments is very expensive and time consuming. The latter calls for the need to develop downscaled testbeds, deployed in controlled environments, where tests can be conducted under predictable conditions. This paper presents a methodology to realize the downscaling of a real deployment on an experimental platform, called controllable testbed that has a much larger number of nodes with respect to the real one. The downscaling procedure proposed is based on the identification of the most appropriate subset of nodes of the controllable testbed, to be used to reproduce the channel gains between each node pair in the real world. The latter, in fact, results in obtaining the same network topologies, bringing to the same performance on average, when the same protocol stack and software are run. After the description of the procedure, an example of its implementation is provided. Comparison of results, in terms of packet loss rate (PLR), network throughput, and topologies achieved on the downscaled testbed and on the real-world deployment, is given; results show a very good fit and demonstrate the efficacy of the proposed methodology.
- 15 February 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 3 (5) , 647-657
From a Real Deployment to a Downscaled Testbed: A Methodological Approach
This paper proposes a novel methodology for the spatial downscaling of real-world deployments of wireless networks, running protocols, and/or applications for the Internet of Things (IoT). These networks are often deployed in environments not easily accessible and highly unpredictable, where doing experiments is very expensive and time consuming. The latter calls for the need to develop downscaled testbeds, deployed in controlled environments, where tests can be conducted under predictable conditions. This paper presents a methodology to realize the downscaling of a real deployment on an experimental platform, called controllable testbed that has a much larger number of nodes with respect to the real one. The downscaling procedure proposed is based on the identification of the most appropriate subset of nodes of the controllable testbed, to be used to reproduce the channel gains between each node pair in the real world. The latter, in fact, results in obtaining the same network topologies, bringing to the same performance on average, when the same protocol stack and software are run. After the description of the procedure, an example of its implementation is provided. Comparison of results, in terms of packet loss rate (PLR), network throughput, and topologies achieved on the downscaled testbed and on the real-world deployment, is given; results show a very good fit and demonstrate the efficacy of the proposed methodology.
- 6 July 2015
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (2) , 591-601
Enhanced exact solution methods for the Team Orienteering Problem
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price approach to find proven optimal solutions to TOP. The pricing sub-problem is solved by a bounded bidirectional dynamic programming algorithm with decremental state space relaxation featuring a two-phase dominance rule relaxation. The new method is able to close 17 previously unsolved benchmark instances. In addition, we propose a Branch-and-Cut-and-Price approach using subset-row inequalities and show the effectiveness of these cuts in solving TOP
- 6 July 2015
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (2) , 591-601
Enhanced exact solution methods for the Team Orienteering Problem
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price approach to find proven optimal solutions to TOP. The pricing sub-problem is solved by a bounded bidirectional dynamic programming algorithm with decremental state space relaxation featuring a two-phase dominance rule relaxation. The new method is able to close 17 previously unsolved benchmark instances. In addition, we propose a Branch-and-Cut-and-Price approach using subset-row inequalities and show the effectiveness of these cuts in solving TOP
- 30 April 2015
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 28 (3) , 517-545
Community detection with the weighted parsimony criterion
- 30 April 2015
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 28 (3) , 517-545
Community detection with the weighted parsimony criterion
- 19 March 2015
- Published by Springer Nature in TOP
- Vol. 23 (2) , 366-368
Rejoinder on: an overview of curriculum-based course timetabling
- 19 March 2015
- Published by Springer Nature in TOP
- Vol. 23 (2) , 366-368
Rejoinder on: an overview of curriculum-based course timetabling
- 19 March 2015
- Published by Springer Nature in TOP
- Vol. 23 (2) , 313-349
An overview of curriculum-based course timetabling
- 19 March 2015
- Published by Springer Nature in TOP
- Vol. 23 (2) , 313-349
An overview of curriculum-based course timetabling
- 1 July 2014
- Published by Weston Medical Publishing in Journal of Emergency Management
- Vol. 12 (4) , 287-301
Simulation and optimization models for emergency medical systems planning
The authors address strategic planning problems for emergency medical systems (EMS). In particular, the three following critical decisions are considered: i) how many ambulances to deploy in a given territory at any given point in time, to meet the forecasted demand, yielding an appropriate response time; ii) when ambulances should be used for serving nonurgent requests and when they should better be kept idle for possible incoming urgent requests; iii) how to define an optimal mix of contracts for renting ambulances from private associations to meet the forecasted demand at minimum cost. In particular, analytical models for decision support, based on queuing theory, discrete-event simulation, and integer linear programming were presented. Computational experiments have been done on real data from the city of Milan, Italy.
- 1 July 2014
- Published by Weston Medical Publishing in Journal of Emergency Management
- Vol. 12 (4) , 287-301
Simulation and optimization models for emergency medical systems planning
The authors address strategic planning problems for emergency medical systems (EMS). In particular, the three following critical decisions are considered: i) how many ambulances to deploy in a given territory at any given point in time, to meet the forecasted demand, yielding an appropriate response time; ii) when ambulances should be used for serving nonurgent requests and when they should better be kept idle for possible incoming urgent requests; iii) how to define an optimal mix of contracts for renting ambulances from private associations to meet the forecasted demand at minimum cost. In particular, analytical models for decision support, based on queuing theory, discrete-event simulation, and integer linear programming were presented. Computational experiments have been done on real data from the city of Milan, Italy.