Pasquale Avella
Orcid: 0000-0002-0462-3550
According to our database1,
Pasquale Avella
authored at least 37 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
1
1
2
1
1
1
1
1
1
2
2
1
1
3
3
1
5
2
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Access, 2024
2023
Networks, July, 2023
2022
INFORMS J. Appl. Anal., 2022
CoRR, 2022
2021
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
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
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
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
Oper. Res. Lett., 2009
J. Heuristics, 2009
Comput. Optim. Appl., 2009
2007
A computational study of local search algorithms for Italian high-school timetabling.
J. Heuristics, 2007
2006
Eur. J. Oper. Res., 2006
2005
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling.
J. Sched., 2005
INFORMS J. Comput., 2005
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks.
Eur. J. Oper. Res., 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
2003
2002
Eur. J. Oper. Res., 2002
2001
1999