Maurizio Boccia
Orcid: 0000-0003-4947-9852
According to our database1,
Maurizio Boccia
authored at least 42 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
New features for customer classification in the Flying Sidekick Traveling Salesman Problem.
Expert Syst. Appl., 2024
2023
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
INFORMS J. Appl. Anal., 2022
2021
Eur. J. Oper. Res., 2021
2020
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
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm.
Comput. Oper. Res., 2018
2017
2016
Autom. Remote. Control., 2016
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
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
IEEE Access, 2013
2012
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable.
INFORMS J. Comput., 2012
2011
A computational study of dicut reformulation for the Single Source Capacitated Facility Location problem.
Stud. Inform. Univ., 2011
4OR, 2011
2010
A computational study of exact knapsack separation for the generalized assignment problem.
Comput. Optim. Appl., 2010
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010
2009
Oper. Res. Lett., 2009
J. Math. Model. Algorithms, 2009
J. Heuristics, 2009
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
INFORMS J. Comput., 2005
A decomposition approach for a very large scale optimal diversity management problem.
4OR, 2005
2004
J. Math. Model. Algorithms, 2004
Eur. J. Oper. Res., 2004
2002
Eur. J. Oper. Res., 2002