A penalty function heuristic for the resource constrained shortest path problem. - Pasquale Avella; Maurizio Boccia; Antonio Sforza (Eur. J. Oper. Res., 2002)

Solving a fuel delivery problem by heuristic and exact approaches. - Pasquale Avella; Maurizio Boccia; Antonio Sforza (Eur. J. Oper. Res., 2004)

Resource Constrained Shortest Path Problems in Path Planning for Fleet Management. - Pasquale Avella; Maurizio Boccia; Antonio Sforza (J. Math. Model. Algorithms, 2004)

A decomposition approach for a very large scale optimal diversity management problem. - Pasquale Avella; Maurizio Boccia; Carmine Di Martino; Giuseppe Oliviero; Antonio Sforza; Igor Vasil'ev (4OR, 2005)

A Branch-and-Cut Algorithm for the Median-Path Problem. - Pasquale Avella; Maurizio Boccia; Antonio Sforza; Igor Vasil'ev (Comput. Optim. Appl., 2005)

Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. - Pasquale Avella; Maurizio Boccia; Bernardo D'Auria (INFORMS J. Comput., 2005)

A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes. - Maurizio Boccia; Antonio Sforza; Claudio Sterle; Igor Vasil'ev (J. Math. Model. Algorithms, 2008)

A cutting plane algorithm for the capacitated facility location problem. - Pasquale Avella; Maurizio Boccia (Comput. Optim. Appl., 2009)

An effective heuristic for large-scale capacitated facility location problems. - Pasquale Avella; Maurizio Boccia; Antonio Sforza; Igor Vasil'ev (J. Heuristics, 2009)

Flow Intercepting Facility Location: Problems, Models and Heuristics. - Maurizio Boccia; Antonio Sforza; Claudio Sterle (J. Math. Model. Algorithms, 2009)

Computational experience with general cutting planes for the Set Covering problem. - Pasquale Avella; Maurizio Boccia; Igor Vasil'ev (Oper. Res. Lett., 2009)

A Metaheuristic for a Two Echelon Location-Routing Problem. - Maurizio Boccia; Teodor Gabriel Crainic; Antonio Sforza; Claudio Sterle (SEA, 2010)

A computational study of exact knapsack separation for the generalized assignment problem. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (Comput. Optim. Appl., 2010)

A fast heuristic for a three-dimensional non-convex domain loading problem. - Maurizio Boccia; Serena di Muro; Francesco Mosca; Antonio Sforza; Claudio Sterle (4OR, 2011)

A computational study of dicut reformulation for the Single Source Capacitated Facility Location problem. - Pasquale Avella; Maurizio Boccia; Saverio Salerno (Stud. Inform. Univ., 2011)

An aggregation heuristic for large scale p-median problem. - Pasquale Avella; Maurizio Boccia; Saverio Salerno; Igor Vasilyev (Comput. Oper. Res., 2012)

Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (INFORMS J. Comput., 2012)

A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (IEEE Access, 2013)

Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (Comput. Oper. Res., 2013)

The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. - Maurizio Boccia; Carlo Mannino; Igor Vasilyev (Networks, 2013)

Polyhedral study of simple plant location problem with order. - Igor Vasilyev; Xenia Klimentova; Maurizio Boccia (Oper. Res. Lett., 2013)

Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. - Pasquale Avella; Maurizio Boccia; Laurence A. Wolsey (Networks, 2015)

Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem. - Igor Vasilyev; Pasquale Avella; Maurizio Boccia; Carlo Mannino (DOOR (Supplement), 2016)

A branch and cut heuristic for a runway scheduling problem. - Igor L. Vasilyev; Pasquale Avella; Maurizio Boccia (Autom. Remote. Control., 2016)

An implementation of exact knapsack separation. - Igor Vasilyev; Maurizio Boccia; Saïd Hanafi (J. Glob. Optim., 2016)

Time-Indexed Formulations for the Runway Scheduling Problem. - Pasquale Avella; Maurizio Boccia; Carlo Mannino; Igor Vasilyev (Transp. Sci., 2017)

Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm. - Maurizio Boccia; Teodor Gabriel Crainic; Antonio Sforza; Claudio Sterle (Comput. Oper. Res., 2018)

Single-Period Cutting Planes for Inventory Routing Problems. - Pasquale Avella; Maurizio Boccia; Laurence A. Wolsey (Transp. Sci., 2018)

A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem. - Pasquale Avella; Maurizio Boccia; Sandro Viglione; Igor Vasilyev (MOTOR (2), 2019)

An optimization approach for congestion control in network routing with quality of service requirements. - Pasquale Avella; Giacomo Bernardi; Maurizio Boccia; Sara Mattia (Networks, 2019)

Special issue on: Optimization methods for decision making: advances and applications. - Patrizia Beraldi; Maurizio Boccia; Claudio Sterle (Soft Comput., 2019)

A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas. - Maurizio Boccia; Antonio Diglio; Adriano Masone; Claudio Sterle (LOD (1), 2020)

Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches. - Maurizio Boccia; Adriano Masone; Antonio Sforza; Claudio Sterle (MOTOR, 2020)

A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. - Claudia Archetti; M. Grazia Speranza; Maurizio Boccia; Antonio Sforza; Claudio Sterle (Eur. J. Oper. Res., 2020)

Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches. - Maurizio Boccia; Antonio Sforza; Claudio Sterle (INFORMS J. Comput., 2020)

Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization. - Mauro Russo; Maurizio Boccia; Antonio Sforza; Claudio Sterle (Int. Trans. Oper. Res., 2020)

Predictive Cyber Foraging for Visual Cloud Computing in Large-Scale IoT Systems. - Jon Patman; Dmitrii Chemodanov; Prasad Calyam; Kannappan Palaniappan; Claudio Sterle; Maurizio Boccia (IEEE Trans. Netw. Serv. Manag., 2020)

Weak flow cover inequalities for the capacitated facility location problem. - Pasquale Avella; Maurizio Boccia; Sara Mattia; Fabrizio Rossi (Eur. J. Oper. Res., 2021)

Practice Summary: Solving the External Candidates Exam Schedule in Norway. - Pasquale Avella; Maurizio Boccia; Carlo Mannino; Sandro Viglione (INFORMS J. Appl. Anal., 2022)

The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach. - Maurizio Boccia; Adriano Masone; Claudio Sterle; Teresa Murino (Eur. J. Oper. Res., 2023)

A new MILP formulation for the flying sidekick traveling salesman problem. - Maurizio Boccia; Andrea Mancuso; Adriano Masone; Claudio Sterle (Networks, 2023)

The Covering Tour Problem with Arc Upgrades. - Marta Baldomero-Naranjo; Maurizio Boccia; Andrea Mancuso; Adriano Masone; Antonio M. Rodríguez-Chía; Claudio Sterle (DSA ISC (2), 2024)

New features for customer classification in the Flying Sidekick Traveling Salesman Problem. - Maurizio Boccia; Andrea Mancuso; Adriano Masone; Teresa Murino; Claudio Sterle (Expert Syst. Appl., 2024)

Integrated operating room planning and scheduling: an ILP-Based off-line approach for emergency responsiveness at a local hospital in Naples. - Maurizio Boccia; Andrea Mancuso; Adriano Masone; Claudio Sterle (Soft Comput., 2024)