Остановите войну!
for scientists:
default search action
Pasquale Avella
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Pasquale Avella, Paolo Nobili, Antonio Sassano:
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study. IEEE Access 12: 23725-23732 (2024) - 2023
- [j32]Pasquale Avella, Alice Calamita, Laura Palagi:
A compact formulation for the base station deployment problem in wireless networks. Networks 82(1): 52-67 (2023) - 2022
- [j31]Pasquale Avella, Maurizio Boccia, Carlo Mannino, Sandro Viglione:
Practice Summary: Solving the External Candidates Exam Schedule in Norway. INFORMS J. Appl. Anal. 52(2): 226-231 (2022) - [i1]Pasquale Avella, Alice Calamita, Laura Palagi:
A Computational Study on the Site and Power Assignment Problem in Wireless Networks. CoRR abs/2210.04022 (2022) - 2021
- [j30]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)
2010 – 2019
- 2019
- [j29]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) - [c4]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: 438-451 - 2018
- [j28]Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey:
Single-Period Cutting Planes for Inventory Routing Problems. Transp. Sci. 52(3): 497-508 (2018) - 2017
- [j27]Pasquale Avella, Maurizio Boccia, Carlo Mannino, Igor Vasilyev:
Time-Indexed Formulations for the Runway Scheduling Problem. Transp. Sci. 51(4): 1196-1209 (2017) - 2016
- [j26]Igor L. Vasilyev, Pasquale Avella, Maurizio Boccia:
A branch and cut heuristic for a runway scheduling problem. Autom. Remote. Control. 77(11): 1985-1993 (2016) - [c3]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
- [j25]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): 129-138 (2015) - 2013
- [j24]Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. IEEE Access 1: 475-479 (2013) - [j23]Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 40(8): 2004-2010 (2013) - 2012
- [j22]Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev:
An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7): 1625-1632 (2012) - [j21]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): 165-171 (2012) - 2011
- [j20]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) - [c2]Giovanni Acampora, Pasquale Avella, Vincenzo Loia, Saverio Salerno, Autilia Vitiello:
Improving ontology alignment through memetic algorithms. FUZZ-IEEE 2011: 1783-1790 - 2010
- [j19]Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3): 543-555 (2010)
2000 – 2009
- 2009
- [j18]Pasquale Avella, Maurizio Boccia:
A cutting plane algorithm for the capacitated facility location problem. Comput. Optim. Appl. 43(1): 39-65 (2009) - [j17]Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev:
An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15(6): 597-615 (2009) - [j16]Pasquale Avella, Maurizio Boccia, Igor Vasil'ev:
Computational experience with general cutting planes for the Set Covering problem. Oper. Res. Lett. 37(1): 16-20 (2009) - 2007
- [j15]Pasquale Avella, Sara Mattia, Antonio Sassano:
Metric inequalities and the Network Loading Problem. Discret. Optim. 4(1): 103-114 (2007) - [j14]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): 543-556 (2007) - [j13]Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
Computational study of large-scale p -Median problems. Math. Program. 109(1): 89-114 (2007) - 2006
- [j12]Pasquale Avella, Bernardo D'Auria, Saverio Salerno:
A LP-based heuristic for a time-constrained routing problem. Eur. J. Oper. Res. 173(1): 120-124 (2006) - 2005
- [j11]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): 23-37 (2005) - [j10]Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev:
A Branch-and-Cut Algorithm for the Median-Path Problem. Comput. Optim. Appl. 32(3): 215-230 (2005) - [j9]Pasquale Avella, Domenico Villacci, Antonio Sforza:
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. Eur. J. Oper. Res. 164(2): 505-509 (2005) - [j8]Pasquale Avella, Maurizio Boccia, Bernardo D'Auria:
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. INFORMS J. Comput. 17(2): 183-191 (2005) - [j7]Pasquale Avella, Igor Vasil'ev:
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling. J. Sched. 8(6): 497-514 (2005) - 2004
- [j6]Pasquale Avella, Maurizio Boccia, Antonio Sforza:
Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152(1): 170-179 (2004) - [j5]Pasquale Avella, Maurizio Boccia, Antonio Sforza:
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management. J. Math. Model. Algorithms 3(1): 1-17 (2004) - [c1]Pasquale Avella, Sara Mattia, Antonio Sassano:
Metric Inequalities and the Network Loading Problem. IPCO 2004: 16-32 - 2003
- [j4]Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
A heuristic for large-scale p-median instances. Electron. Notes Discret. Math. 13: 14-17 (2003) - 2002
- [j3]Pasquale Avella, Maurizio Boccia, Antonio Sforza:
A penalty function heuristic for the resource constrained shortest path problem. Eur. J. Oper. Res. 142(2): 221-230 (2002) - 2001
- [j2]Pasquale Avella, Antonio Sassano:
On the p -Median polytope. Math. Program. 89(3): 395-411 (2001)
1990 – 1999
- 1999
- [j1]Pasquale Avella, Antonio Sforza:
Logical reduction tests for the p-problem. Ann. Oper. Res. 86: 105-115 (1999)
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-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint