Maurizio Boccia

Orcid: 0000-0003-4947-9852

According to our database1, Maurizio Boccia authored at least 42 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New features for customer classification in the Flying Sidekick Traveling Salesman Problem.
Expert Syst. Appl., 2024

2023
A new <i>MILP</i> formulation for the flying sidekick traveling salesman problem.
Networks, October, 2023

The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach.
Eur. J. Oper. Res., June, 2023

2022
Practice Summary: Solving the External Candidates Exam Schedule in Norway.
INFORMS J. Appl. Anal., 2022

2021
Weak flow cover inequalities for the capacitated facility location problem.
Eur. J. Oper. Res., 2021

2020
Predictive Cyber Foraging for Visual Cloud Computing in Large-Scale IoT Systems.
IEEE Trans. Netw. Serv. Manag., 2020

Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization.
Int. Trans. Oper. Res., 2020

Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches.
INFORMS J. Comput., 2020

A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries.
Eur. J. Oper. Res., 2020

Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas.
Proceedings of the Machine Learning, Optimization, and Data Science, 2020

2019
Special issue on: Optimization methods for decision making: advances and applications.
Soft Comput., 2019

An optimization approach for congestion control in network routing with quality of service requirements.
Networks, 2019

A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2018
Single-Period Cutting Planes for Inventory Routing Problems.
Transp. Sci., 2018

Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm.
Comput. Oper. Res., 2018

2017
Time-Indexed Formulations for the Runway Scheduling Problem.
Transp. Sci., 2017

2016
An implementation of exact knapsack separation.
J. Glob. Optim., 2016

A branch and cut heuristic for a runway scheduling problem.
Autom. Remote. Control., 2016

Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

2015
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances.
Networks, 2015

2013
Polyhedral study of simple plant location problem with order.
Oper. Res. Lett., 2013

The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming.
Networks, 2013

Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows.
Comput. Oper. Res., 2013

A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem.
IEEE Access, 2013

2012
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable.
INFORMS J. Comput., 2012

An aggregation heuristic for large scale p-median problem.
Comput. Oper. Res., 2012

2011
A computational study of dicut reformulation for the Single Source Capacitated Facility Location problem.
Stud. Inform. Univ., 2011

A fast heuristic for a three-dimensional non-convex domain loading problem.
4OR, 2011

2010
A computational study of exact knapsack separation for the generalized assignment problem.
Comput. Optim. Appl., 2010

A Metaheuristic for a Two Echelon Location-Routing Problem.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
Computational experience with general cutting planes for the Set Covering problem.
Oper. Res. Lett., 2009

Flow Intercepting Facility Location: Problems, Models and Heuristics.
J. Math. Model. Algorithms, 2009

An effective heuristic for large-scale capacitated facility location problems.
J. Heuristics, 2009

A cutting plane algorithm for the capacitated facility location problem.
Comput. Optim. Appl., 2009

2008
A Cut and Branch Approach for the Capacitated <i>p</i>-Median Problem Based on Fenchel Cutting Planes.
J. Math. Model. Algorithms, 2008

2005
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems.
INFORMS J. Comput., 2005

A Branch-and-Cut Algorithm for the Median-Path Problem.
Comput. Optim. Appl., 2005

A decomposition approach for a very large scale optimal diversity management problem.
4OR, 2005

2004
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management.
J. Math. Model. Algorithms, 2004

Solving a fuel delivery problem by heuristic and exact approaches.
Eur. J. Oper. Res., 2004

2002
A penalty function heuristic for the resource constrained shortest path problem.
Eur. J. Oper. Res., 2002


  Loading...