Maurizio Boccia

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 20

Top Topics

Traveling Salesman

Integer Program

Valid Inequalities

Guillotine Cutting

Top Venues

Eur. J. Oper. Res.

IEEE Trans. Netw. Serv. Manag.

Publications

Maurizio Boccia, Andrea Mancuso, Adriano Masone, Teresa Murino, Claudio Sterle
New features for customer classification in the Flying Sidekick Traveling Salesman Problem. Expert Syst. Appl. 247 (2024)
Maurizio Boccia, Andrea Mancuso, Adriano Masone, Claudio Sterle
formulation for the flying sidekick traveling salesman problem. Networks 82 (3) (2023)
Maurizio Boccia, Adriano Masone, Claudio Sterle, Teresa Murino
The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach. Eur. J. Oper. Res. 307 (2) (2023)
Pasquale Avella, Maurizio Boccia, Carlo Mannino, Sandro Viglione
Practice Summary: Solving the External Candidates Exam Schedule in Norway. INFORMS J. Appl. Anal. 52 (2) (2022)
Pasquale Avella, Maurizio Boccia, Sara Mattia, Fabrizio Rossi
Weak flow cover inequalities for the capacitated facility location problem. Eur. J. Oper. Res. 289 (2) (2021)
Claudia Archetti, M. Grazia Speranza, Maurizio Boccia, Antonio Sforza, Claudio Sterle
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 282 (3) (2020)
Maurizio Boccia, Adriano Masone, Antonio Sforza, Claudio Sterle
Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches. MOTOR (2020)
Mauro Russo, Maurizio Boccia, Antonio Sforza, Claudio Sterle
Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization. Int. Trans. Oper. Res. 27 (2) (2020)
Maurizio Boccia, Antonio Diglio, Adriano Masone, Claudio Sterle
A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas. LOD (1) (2020)
Jon Patman, Dmitrii Chemodanov, Prasad Calyam, Kannappan Palaniappan, Claudio Sterle, Maurizio Boccia
Predictive Cyber Foraging for Visual Cloud Computing in Large-Scale IoT Systems. IEEE Trans. Netw. Serv. Manag. 17 (4) (2020)
Maurizio Boccia, Antonio Sforza, Claudio Sterle
Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches. INFORMS J. Comput. 32 (4) (2020)
Pasquale Avella, Maurizio Boccia, Sandro Viglione, Igor Vasilyev
A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem. MOTOR (2) (2019)
Patrizia Beraldi, Maurizio Boccia, Claudio Sterle
Special issue on: Optimization methods for decision making: advances and applications. Soft Comput. 23 (9) (2019)
Pasquale Avella, Giacomo Bernardi, Maurizio Boccia, Sara Mattia
An optimization approach for congestion control in network routing with quality of service requirements. Networks 74 (2) (2019)
Maurizio Boccia, Teodor Gabriel Crainic, Antonio Sforza, Claudio Sterle
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm. Comput. Oper. Res. 89 (2018)
Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
Single-Period Cutting Planes for Inventory Routing Problems. Transp. Sci. 52 (3) (2018)
Pasquale Avella, Maurizio Boccia, Carlo Mannino, Igor Vasilyev
Time-Indexed Formulations for the Runway Scheduling Problem. Transp. Sci. 51 (4) (2017)
Igor Vasilyev, Maurizio Boccia, Saïd Hanafi
An implementation of exact knapsack separation. J. Glob. Optim. 66 (1) (2016)
Igor L. Vasilyev, Pasquale Avella, Maurizio Boccia
A branch and cut heuristic for a runway scheduling problem. Autom. Remote. Control. 77 (11) (2016)
Igor Vasilyev, Pasquale Avella, Maurizio Boccia, Carlo Mannino
Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem. DOOR (Supplement) (2016)
Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65 (2) (2015)
Igor Vasilyev, Xenia Klimentova, Maurizio Boccia
Polyhedral study of simple plant location problem with order. Oper. Res. Lett. 41 (2) (2013)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 40 (8) (2013)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. IEEE Access 1 (2013)
Maurizio Boccia, Carlo Mannino, Igor Vasilyev
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. Networks 62 (4) (2013)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. INFORMS J. Comput. 24 (1) (2012)
Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev
An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39 (7) (2012)
Pasquale Avella, Maurizio Boccia, Saverio Salerno
A computational study of dicut reformulation for the Single Source Capacitated Facility Location problem. Stud. Inform. Univ. 9 (3) (2011)
Maurizio Boccia, Serena di Muro, Francesco Mosca, Antonio Sforza, Claudio Sterle
A fast heuristic for a three-dimensional non-convex domain loading problem. 4OR 9 (1) (2011)
Maurizio Boccia, Teodor Gabriel Crainic, Antonio Sforza, Claudio Sterle
A Metaheuristic for a Two Echelon Location-Routing Problem. SEA (2010)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45 (3) (2010)
Pasquale Avella, Maurizio Boccia, Igor Vasil'ev
Computational experience with general cutting planes for the Set Covering problem. Oper. Res. Lett. 37 (1) (2009)
Maurizio Boccia, Antonio Sforza, Claudio Sterle
Flow Intercepting Facility Location: Problems, Models and Heuristics. J. Math. Model. Algorithms 8 (1) (2009)
Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev
An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15 (6) (2009)
Pasquale Avella, Maurizio Boccia
A cutting plane algorithm for the capacitated facility location problem. Comput. Optim. Appl. 43 (1) (2009)
Maurizio Boccia, Antonio Sforza, Claudio Sterle, Igor Vasil'ev
-Median Problem Based on Fenchel Cutting Planes. J. Math. Model. Algorithms 7 (1) (2008)
Pasquale Avella, Maurizio Boccia, Bernardo D'Auria
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. INFORMS J. Comput. 17 (2) (2005)
Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev
A decomposition approach for a very large scale optimal diversity management problem. 4OR 3 (1) (2005)
Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev
A Branch-and-Cut Algorithm for the Median-Path Problem. Comput. Optim. Appl. 32 (3) (2005)
Pasquale Avella, Maurizio Boccia, Antonio Sforza
Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152 (1) (2004)
Pasquale Avella, Maurizio Boccia, Antonio Sforza
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management. J. Math. Model. Algorithms 3 (1) (2004)
Pasquale Avella, Maurizio Boccia, Antonio Sforza
A penalty function heuristic for the resource constrained shortest path problem. Eur. J. Oper. Res. 142 (2) (2002)