default search action
Maurizio Boccia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Maurizio Boccia
, Andrea Mancuso
New features for customer classification in the Flying Sidekick Traveling Salesman Problem. Expert Syst. Appl. 247: 123106 (2024) - 2023
- [j36]Maurizio Boccia, Adriano Masone
The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach. Eur. J. Oper. Res. 307(2): 590-603 (2023) - [j35]Maurizio Boccia, Andrea Mancuso
A new MILP formulation for the flying sidekick traveling salesman problem. Networks 82(3): 254-276 (2023) - 2022
- [j34]Pasquale Avella
Practice Summary: Solving the External Candidates Exam Schedule in Norway. INFORMS J. Appl. Anal. 52(2): 226-231 (2022) - 2021
- [j33]Pasquale Avella, Maurizio Boccia, Sara Mattia, Fabrizio Rossi
Weak flow cover inequalities for the capacitated facility location problem. Eur. J. Oper. Res. 289(2): 485-494 (2021) - 2020
- [j32]Claudia Archetti
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 282(3): 886-895 (2020) - [j31]Maurizio Boccia
Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches. INFORMS J. Comput. 32(4): 1049-1060 (2020) - [j30]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): 794-834 (2020) - [j29]Jon Patman
Predictive Cyber Foraging for Visual Cloud Computing in Large-Scale IoT Systems. IEEE Trans. Netw. Serv. Manag. 17(4): 2380-2395 (2020) - [c5]Maurizio Boccia, Antonio Diglio
A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas. LOD (1) 2020: 625-636 - [c4]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: 315-328
2010 – 2019
- 2019
- [j28]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): 124-133 (2019) - [j27]Patrizia Beraldi, Maurizio Boccia, Claudio Sterle:
Special issue on: Optimization methods for decision making: advances and applications. Soft Comput. 23(9): 2849-2852 (2019) - [c3]Pasquale Avella
A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem. MOTOR (2) 2019: 438-451 - 2018
- [j26]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: 94-112 (2018) - [j25]Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey:
Single-Period Cutting Planes for Inventory Routing Problems. Transp. Sci. 52(3): 497-508 (2018) - 2017
- [j24]Pasquale Avella, Maurizio Boccia
Time-Indexed Formulations for the Runway Scheduling Problem. Transp. Sci. 51(4): 1196-1209 (2017) - 2016
- [j23]Igor L. Vasilyev
A branch and cut heuristic for a runway scheduling problem. Autom. Remote. Control. 77(11): 1985-1993 (2016) - [j22]Igor Vasilyev
An implementation of exact knapsack separation. J. Glob. Optim. 66(1): 127-150 (2016) - [c2]Igor Vasilyev, Pasquale Avella, Maurizio Boccia, Carlo Mannino:
Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem. DOOR (Supplement) 2016: 787-790 - 2015
- [j21]Pasquale Avella
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65(2): 129-138 (2015) - 2013
- [j20]Pasquale Avella
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. IEEE Access 1: 475-479 (2013) - [j19]Pasquale Avella
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 40(8): 2004-2010 (2013) - [j18]Maurizio Boccia, Carlo Mannino, Igor Vasilyev
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. Networks 62(4): 315-326 (2013) - [j17]Igor Vasilyev
Polyhedral study of simple plant location problem with order. Oper. Res. Lett. 41(2): 153-158 (2013) - 2012
- [j16]Pasquale Avella
An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7): 1625-1632 (2012) - [j15]Pasquale Avella
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. INFORMS J. Comput. 24(1): 165-171 (2012) - 2011
- [j14]Maurizio Boccia
A fast heuristic for a three-dimensional non-convex domain loading problem. 4OR 9(1): 83-101 (2011) - [j13]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): 21-42 (2011) - 2010
- [j12]Pasquale Avella
A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3): 543-555 (2010) - [c1]Maurizio Boccia, Teodor Gabriel Crainic
A Metaheuristic for a Two Echelon Location-Routing Problem. SEA 2010: 288-301
2000 – 2009
- 2009
- [j11]Pasquale Avella
A cutting plane algorithm for the capacitated facility location problem. Comput. Optim. Appl. 43(1): 39-65 (2009) - [j10]Pasquale Avella
An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15(6): 597-615 (2009) - [j9]Maurizio Boccia
Flow Intercepting Facility Location: Problems, Models and Heuristics. J. Math. Model. Algorithms 8(1): 35-79 (2009) - [j8]Pasquale Avella
Computational experience with general cutting planes for the Set Covering problem. Oper. Res. Lett. 37(1): 16-20 (2009) - 2008
- [j7]Maurizio Boccia
A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes. J. Math. Model. Algorithms 7(1): 43-58 (2008) - 2005
- [j6]Pasquale Avella
A decomposition approach for a very large scale optimal diversity management problem. 4OR 3(1): 23-37 (2005) - [j5]Pasquale Avella
A Branch-and-Cut Algorithm for the Median-Path Problem. Comput. Optim. Appl. 32(3): 215-230 (2005) - [j4]Pasquale Avella
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. INFORMS J. Comput. 17(2): 183-191 (2005) - 2004
- [j3]Pasquale Avella
Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152(1): 170-179 (2004) - [j2]Pasquale Avella
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management. J. Math. Model. Algorithms 3(1): 1-17 (2004) - 2002
- [j1]Pasquale Avella
A penalty function heuristic for the resource constrained shortest path problem. Eur. J. Oper. Res. 142(2): 221-230 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: