Pasquale Avella

Orcid: 0000-0002-0462-3550

According to our database1, Pasquale Avella authored at least 37 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study.
IEEE Access, 2024

2023
A compact formulation for the base station deployment problem in wireless networks.
Networks, July, 2023

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

A Computational Study on the Site and Power Assignment Problem in Wireless Networks.
CoRR, 2022

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

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

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

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
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

Improving ontology alignment through memetic algorithms.
Proceedings of the FUZZ-IEEE 2011, 2011

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

2009
Computational experience with general cutting planes for the Set Covering problem.
Oper. Res. Lett., 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

2007
Computational study of large-scale <i>p</i> -Median problems.
Math. Program., 2007

A computational study of local search algorithms for Italian high-school timetabling.
J. Heuristics, 2007

Metric inequalities and the Network Loading Problem.
Discret. Optim., 2007

2006
A LP-based heuristic for a time-constrained routing problem.
Eur. J. Oper. Res., 2006

2005
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling.
J. Sched., 2005

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

A Steiner arborescence model for the feeder reconfiguration in electric distribution networks.
Eur. J. Oper. Res., 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

2003
A heuristic for large-scale p-median instances.
Electron. Notes Discret. Math., 2003

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

2001
On the <i>p</i> -Median polytope.
Math. Program., 2001

1999
Logical reduction tests for the p-problem.
Ann. Oper. Res., 1999


  Loading...