default search action
Laura Palagi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Federico D'Onofrio
, Giorgio Grani, Marta Monaci
Margin optimal classification trees. Comput. Oper. Res. 161: 106441 (2024) - [j29]Giulia Di Teodoro
Unboxing Tree ensembles for interpretability: A hierarchical visualization tool and a multivariate optimal re-built tree. EURO J. Comput. Optim. 12: 100084 (2024) - [i11]Alice Calamita, Ivana Ljubic, Laura Palagi:
Benders decomposition for congested partial set covering location with uncertain demand. CoRR abs/2401.12625 (2024) - [i10]Immanuel M. Bomze, Federico D'Onofrio, Laura Palagi, Bo Peng:
Feature selection in linear SVMs via hard cardinality constraint: a scalable SDP decomposition approach. CoRR abs/2404.10099 (2024) - 2023
- [j28]Pasquale Avella
A compact formulation for the base station deployment problem in wireless networks. Networks 82(1): 52-67 (2023) - [i9]Giulia Di Teodoro, Marta Monaci
Unboxing Tree Ensembles for interpretability: a hierarchical visualization tool and a multivariate optimal re-built tree. CoRR abs/2302.07580 (2023) - [i8]Giulia Di Teodoro, Martin Pirkl, Francesca Incardona, Ilaria Vicenti, Anders Sönnerborg, Rolf Kaiser, Laura Palagi, Maurizio Zazzi, Thomas Lengauer:
Incorporating temporal dynamics of mutations to enhance the prediction capability of antiretroviral therapy's outcome for HIV-1. CoRR abs/2311.04846 (2023) - [i7]Giulia Di Teodoro, Federico Siciliano, Valerio Guarrasi, Anne-Mieke Vandamme, Valeria Ghisetti, Anders Sönnerborg, Maurizio Zazzi, Fabrizio Silvestri, Laura Palagi:
A graph neural network-based model with Out-of-Distribution Robustness for enhancing Antiretroviral Therapy Outcome Prediction for HIV-1. CoRR abs/2312.17506 (2023) - 2022
- [i6]Marianna Maranghi, Aris Anagnostopoulos, Irene Cannistraci
AI-based Data Preparation and Data Analytics in Healthcare: The Case of Diabetes. CoRR abs/2206.06182 (2022) - [i5]Simone Foa, Corrado Coppola, Giorgio Grani
Solving the vehicle routing problem with deep reinforcement learning. CoRR abs/2208.00202 (2022) - [i4]Pasquale Avella, Alice Calamita, Laura Palagi:
A Computational Study on the Site and Power Assignment Problem in Wireless Networks. CoRR abs/2210.04022 (2022) - [i3]Federico D'Onofrio, Giorgio Grani
Margin Optimal Classification Trees. CoRR abs/2210.10567 (2022) - [i2]Giampaolo Liuzzi, Laura Palagi, Ruggiero Seccia:
Convergence under Lipschitz smoothness of ease-controlled Random Reshuffling gradient Algorithms. CoRR abs/2212.01848 (2022) - 2021
- [j27]Giuseppe Bernabei, Francesco Costantino, Laura Palagi, Riccardo Patriarca, Francesco Romito:
An Integer Black-Box Optimization Model for Repairable Spare Parts Management. Int. J. Inf. Syst. Supply Chain Manag. 14(2): 46-68 (2021) - [j26]Laura Palagi, Ruggiero Seccia
On the convergence of a Block-Coordinate Incremental Gradient method. Soft Comput. 25(19): 12615-12626 (2021) - 2020
- [j25]Marianna De Santis
Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming. Eur. J. Oper. Res. 283(1): 57-69 (2020) - [j24]Laura Palagi
Block layer decomposition schemes for training deep neural networks. J. Glob. Optim. 77(1): 97-124 (2020) - [i1]Laura Palagi, Ruggiero Seccia:
Block Layer Decomposition schemes for training Deep Neural Networks. CoRR abs/2003.08123 (2020)
2010 – 2019
- 2019
- [j23]Andrea Manno
Case Article - Production and Distribution Optimization of Beach Equipment for the Marinero Company. INFORMS Trans. Educ. 19(3): 152-154 (2019) - [j22]Andrea Manno
Case - Production and Distribution Optimization of Beach Equipment for the Marinero Company. INFORMS Trans. Educ. 19(3): 155-159 (2019) - [j21]Laura Palagi
Global optimization issues in deep network regression: an overview. J. Glob. Optim. 73(2): 239-277 (2019) - [c4]Emma Colamarino, Tommaso Colombo, Floriana Pichiorri, Donatella Mattia, Laura Palagi, Febo Cincotti:
Swlda Offers a Valuable Trade-off between interpretability and accuracy for rehabilitative BCIs. GBCIC 2019 - 2018
- [j20]Andrea Manno
Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training. Comput. Optim. Appl. 71(1): 115-145 (2018) - 2017
- [c3]Yuri M. Chianese, Alessandro Avenali, Raffaele Gambuti, Laura Palagi
One-Way Free Floating Car-Sharing: Applying Vehicle-Generated Data to Assess the Market Demand Potential of Urban Zones. COMPSAC (2) 2017: 777-782 - 2015
- [j19]Umberto Dellepiane, Laura Palagi
Using SVM to combine global heuristics for the Standard Quadratic Problem. Eur. J. Oper. Res. 241(3): 596-605 (2015) - [j18]Laura Palagi
Foreword. Optim. Methods Softw. 30(2): 251-252 (2015) - [j17]Christoph Buchheim
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. Oper. Res. Lett. 43(4): 384-388 (2015) - [c2]Guido Oddi, Antonio Pietrabissa
A QoE-aware dynamic bandwidth allocation algorithm based on game theory. MED 2015: 979-985 - [c1]Silvia Canale, Federico Cimorelli, Francisco Facchinei, Raffaele Gambuti, Laura Palagi
Profiled QoE based network controller. MED 2015: 1085-1091 - 2013
- [j16]Christoph Buchheim
An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations. SIAM J. Optim. 23(3): 1867-1889 (2013) - 2012
- [j15]Luigi Grippo, Laura Palagi
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances. Math. Program. 136(2): 353-373 (2012) - 2011
- [j14]Luigi Grippo, Laura Palagi
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Math. Program. 126(1): 119-146 (2011) - [j13]Giampaolo Liuzzi
On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds. Optim. Lett. 5(2): 347-362 (2011) - 2010
- [j12]Gianni Di Pillo
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming. Comput. Optim. Appl. 45(2): 311-352 (2010)
2000 – 2009
- 2009
- [j11]Luigi Grippo, Laura Palagi
Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems. J. Glob. Optim. 44(3): 339-348 (2009) - [j10]Stefano Lucidi
A Convergent Hybrid Decomposition Algorithm Model for SVM Training. IEEE Trans. Neural Networks 20(6): 1055-1060 (2009) - [r1]Laura Palagi:
Large Scale Trust Region Problems. Encyclopedia of Optimization 2009: 1822-1831 - 2007
- [j9]Stefano Lucidi
A convergent decomposition algorithm for support vector machines. Comput. Optim. Appl. 38(2): 217-234 (2007) - 2005
- [j8]Immanuel M. Bomze
Quartic Formulation of Standard Quadratic Optimization Problems. J. Glob. Optim. 32(2): 181-205 (2005) - [j7]Gianni Di Pillo
Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming. Math. Oper. Res. 30(4): 897-915 (2005) - [j6]Laura Palagi
On the convergence of a modified version of SVMlight algorithm. Optim. Methods Softw. 20(2-3): 317-334 (2005) - 2003
- [j5]Gianni Di Pillo
An Exact Augmented Lagrangian Function for Nonlinear Programming with Two-Sided Constraints. Comput. Optim. Appl. 25(1-3): 57-83 (2003) - 2002
- [j4]Francisco Facchinei
A Truncated Newton Algorithm for Large Scale Box Constrained Optimization. SIAM J. Optim. 12(4): 1100-1125 (2002)
1990 – 1999
- 1999
- [j3]Gianni Di Pillo, Stefano Lucidi
A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems. Comput. Optim. Appl. 12(1-3): 157-188 (1999) - [j2]A. Ciancimino, G. Inzerillo, Stefano Lucidi
A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem. Transp. Sci. 33(2): 168-181 (1999) - 1998
- [j1]Stefano Lucidi
On Some Properties of Quadratic Programs with a Convex Quadratic Constraint. SIAM J. Optim. 8(1): 105-122 (1998)
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:16 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: