MBMarco Antonio Boschetti

Marco Antonio Boschetti

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Marco Antonio Boschetti has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Two-stage one-dimensional cutting stock problem with flexible item sizes in steel industry

    by Ying Meng, Lixin Tang, Roberto Baldacci, Marco Antonio Boschetti, Jiyin Liu, Md Al Amin

  • Open Access

    Contemporary approaches in matheuristics an updated survey

    by Marco Antonio Boschetti, Vittorio Maniezzo

    Matheuristics are problem independent frameworks that use mathematical programming tools to obtain high quality heuristic solutions. They are structurally general enough to be applied to different problems with little adaptation to their abstract structure, so they can be considered as new or hybrid metaheuristics based on components derived from the mathematical model of the problems of interest. In this survey, we emphasize the mathematical tools and describe how they can be used to design heuristics. We focus on mixed-integer linear programming and report representative examples from the literature of how it has been used for effective heuristic optimization. References to contributions to matheuristics deriving from neighboring research areas such as Artificial Intelligence or Quantum Computing are also included. We conclude with some ideas for possible future developments. This paper extends an original version published in 4OR with new sections on CMSA, Incremental Core, AI hybrids and Quantum Heuristics, and includes references to several recent publications.


  • Last‐mile delivery with drone and lockers

    by Marco Antonio Boschetti, Stefano Novellani

    In this article, we define a new routing problem that arises in the last‐mile delivery of parcels, in which customers can be served either directly at home by a capacitated truck, or possibly with a drone carried on the truck, or in a self‐service mode using one of the available lockers. We investigate four different formulations, and for one of them, we propose a branch‐and‐cut approach. We also discuss some possible variants of the original problem. In the computational experiments, we analyze and compare the performance of the four formulations for the problem and its variants, and we provide some useful managerial insights.


  • Open Access

    Graph-Enhanced Biomedical Abstractive Summarization Via Factual Evidence Extraction

    by Giacomo Frisoni, Paolo Italiani, Gianluca Moro, Ilaria Bartolini, Marco Antonio Boschetti, Antonella Carbonaro

    Infusing structured semantic representations into language models is a rising research trend underpinning many natural language processing tasks that require understanding and reasoning capabilities. Decoupling factual non-ambiguous concept units from the lexical surface holds great potential in abstractive summarization, especially in the biomedical domain, where fact selection and rephrasing are made more difficult by specialized jargon and hard factuality constraints. Nevertheless, current graph-augmented contributions rely on extractive binary relations, failing to model real-world n-ary and nested biomedical interactions mentioned in the text. To alleviate this issue, we present EASumm, the first framework for biomedical abstractive summarization empowered by event extraction, namely graph-based representations of relevant medical evidence derived from the source scientific document. By relying on dual text-graph encoders, we prove the promising role of explicit event structures, achieving better or comparable performance than previous state-of-the-art models on the CDSR dataset. We conduct extensive ablation studies, including a wide experimentation of graph representation learning techniques. Finally, we offer some hints to guide future research in the field.


  • Self-adaptive Publish/Subscribe Network Design

    by Vittorio Maniezzo, Marco A. Boschetti, Pietro Manzoni


  • Top Cited Papers
    Open Access

    Matheuristics: using mathematics for heuristic design

    by Marco Antonio Boschetti, Vittorio Maniezzo

    Matheuristics are heuristic algorithms based on mathematical tools such as the ones provided by mathematical programming, that are structurally general enough to be applied to different problems with little adaptations to their abstract structure. The result can be metaheuristic hybrids having components derived from the mathematical model of the problems of interest, but the mathematical techniques themselves can define general heuristic solution frameworks. In this paper, we focus our attention on mathematical programming and its contributions to developing effective heuristics. We briefly describe the mathematical tools available and then some matheuristic approaches, reporting some representative examples from the literature. We also take the opportunity to provide some ideas for possible future development.


  • Open Access

    Modeling Distributed MQTT Systems Using Multicommodity Flow Analysis

    by Pietro Manzoni, Vittorio Maniezzo, Marco A. Boschetti

    The development of technologies that exploit the Internet of Things (IoT) paradigm has led to the increasingly widespread use of networks formed by different devices scattered throughout the territory. The Publish/Subscribe paradigm is one of the most used communication paradigms for applications of this type. However, adopting these systems due to their centralized structure also leads to the emergence of various problems and limitations. For example, the broker is typically the single point of failure of the system: no communication is possible if the broker is unavailable. Moreover, they may not scale well considering the massive numbers of IoT devices forecasted in the future. Finally, a network architecture with a single central broker is partially at odds with the edge-oriented approach. This work focuses on the development of an adaptive topology control approach, able to find the most efficient network configuration maximizing the number of connections and reduce the waste of resources within it, starting from the definition of the devices and the connections between them present in the system. To reach the goal, we leverage an integer linear programming mathematical formulation, providing the basis to solve and optimize the problem of network configuration in contexts where the resources available to the devices are limited.


  • An exact method for shrinking pivot tables

    by Marco A. Boschetti, Matteo Golfarelli, Simone Graziani


  • Open Access

    Client-side Computational Optimization

    by Vittorio Maniezzo, Marco A. Boschetti, Antonella Carbonaro, Moreno Marzolla, Francesco Strappaveccia

    Mobile platforms have matured to a point where they can provide the infrastructure required to support sophisticated optimization codes. This opens the possibility to envisage new interest for distributed application codes and the opportunity to intensify research on optimization algorithms requiring limited computational resources, as provided by mobile platforms. In this article, we report on some exploratory experience in this area. We illustrate some practical, real-world cases where running optimization programs on mobile or embedded devices can be useful, with particular emphasis on matheuristics approaches. Then, we discuss a practical use case involving the feasibility version of the generalized assignment problem (GAP). We present a JavaScript implementation of a GAP solver that can be executed inside an ordinary browser supporting ECMAScript. We tested the code on different smartphones of varying age and power, as well as on desktop PCs and other embedded devices. Our experiments confirm the viability of mobile devices for computational intensive tasks.