Pasquale Avella

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 12

Top Topics

Valid Inequalities

Integer Program

Scheduling Problem

Top Venues

INFORMS J. Appl. Anal.

Publications

Pasquale Avella, Paolo Nobili, Antonio Sassano
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study. IEEE Access 12 (2024)
Pasquale Avella, Alice Calamita, Laura Palagi
A compact formulation for the base station deployment problem in wireless networks. Networks 82 (1) (2023)
Pasquale Avella, Alice Calamita, Laura Palagi
A Computational Study on the Site and Power Assignment Problem in Wireless Networks. CoRR (2022)
Pasquale Avella, Maurizio Boccia, Carlo Mannino, Sandro Viglione
Practice Summary: Solving the External Candidates Exam Schedule in Norway. INFORMS J. Appl. Anal. 52 (2) (2022)
Pasquale Avella, Maurizio Boccia, Sara Mattia, Fabrizio Rossi
Weak flow cover inequalities for the capacitated facility location problem. Eur. J. Oper. Res. 289 (2) (2021)
Pasquale Avella, Maurizio Boccia, Sandro Viglione, Igor Vasilyev
A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem. MOTOR (2) (2019)
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) (2019)
Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
Single-Period Cutting Planes for Inventory Routing Problems. Transp. Sci. 52 (3) (2018)
Pasquale Avella, Maurizio Boccia, Carlo Mannino, Igor Vasilyev
Time-Indexed Formulations for the Runway Scheduling Problem. Transp. Sci. 51 (4) (2017)
Igor L. Vasilyev, Pasquale Avella, Maurizio Boccia
A branch and cut heuristic for a runway scheduling problem. Autom. Remote. Control. 77 (11) (2016)
Igor Vasilyev, Pasquale Avella, Maurizio Boccia, Carlo Mannino
Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem. DOOR (Supplement) (2016)
Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65 (2) (2015)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 40 (8) (2013)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. IEEE Access 1 (2013)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. INFORMS J. Comput. 24 (1) (2012)
Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev
An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39 (7) (2012)
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) (2011)
Giovanni Acampora, Pasquale Avella, Vincenzo Loia, Saverio Salerno, Autilia Vitiello
Improving ontology alignment through memetic algorithms. FUZZ-IEEE (2011)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45 (3) (2010)
Pasquale Avella, Maurizio Boccia, Igor Vasil'ev
Computational experience with general cutting planes for the Set Covering problem. Oper. Res. Lett. 37 (1) (2009)
Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev
An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15 (6) (2009)
Pasquale Avella, Maurizio Boccia
A cutting plane algorithm for the capacitated facility location problem. Comput. Optim. Appl. 43 (1) (2009)
Pasquale Avella, Sara Mattia, Antonio Sassano
Metric inequalities and the Network Loading Problem. Discret. Optim. 4 (1) (2007)
Pasquale Avella, Bernardo D'Auria, Saverio Salerno, Igor Vasil'ev
A computational study of local search algorithms for Italian high-school timetabling. J. Heuristics 13 (6) (2007)
Pasquale Avella, Antonio Sassano, Igor Vasil'ev
-Median problems. Math. Program. 109 (1) (2007)
Pasquale Avella, Bernardo D'Auria, Saverio Salerno
A LP-based heuristic for a time-constrained routing problem. Eur. J. Oper. Res. 173 (1) (2006)
Pasquale Avella, Maurizio Boccia, Bernardo D'Auria
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. INFORMS J. Comput. 17 (2) (2005)
Pasquale Avella, Igor Vasil'ev
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling. J. Sched. 8 (6) (2005)
Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev
A decomposition approach for a very large scale optimal diversity management problem. 4OR 3 (1) (2005)
Pasquale Avella, Domenico Villacci, Antonio Sforza
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. Eur. J. Oper. Res. 164 (2) (2005)
Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev
A Branch-and-Cut Algorithm for the Median-Path Problem. Comput. Optim. Appl. 32 (3) (2005)
Pasquale Avella, Maurizio Boccia, Antonio Sforza
Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152 (1) (2004)
Pasquale Avella, Maurizio Boccia, Antonio Sforza
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management. J. Math. Model. Algorithms 3 (1) (2004)
Pasquale Avella, Sara Mattia, Antonio Sassano
Metric Inequalities and the Network Loading Problem. IPCO (2004)
Pasquale Avella, Antonio Sassano, Igor Vasil'ev
A heuristic for large-scale p-median instances. Electron. Notes Discret. Math. 13 (2003)
Pasquale Avella, Maurizio Boccia, Antonio Sforza
A penalty function heuristic for the resource constrained shortest path problem. Eur. J. Oper. Res. 142 (2) (2002)
Pasquale Avella, Antonio Sassano
-Median polytope. Math. Program. 89 (3) (2001)
Pasquale Avella, Antonio Sforza
Logical reduction tests for the p-problem. Ann. Oper. Res. 86 (1999)