Maurizio Boccia

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