default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Del Pia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
:
New classes of Facets for complementarity knapsack problems. Discret. Appl. Math. 356: 247-262 (2024)- [j44]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
Relaxations and cutting planes for linear programs with complementarity constraints. J. Glob. Optim. 90(1): 27-51 (2024) - [j43]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
On the complexity of separating cutting planes for the knapsack polytope. Math. Program. 206(1): 33-59 (2024) - [j42]Alberto Del Pia, Matthias Walter:
Simple odd β-cycle inequalities for binary polynomial optimization. Math. Program. 206(1): 203-238 (2024) - [j41]Alberto Del Pia, Aida Khajavirad:
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs. Math. Program. 207(1): 269-301 (2024) - [c14]Alberto Del Pia, Dusan Knop, Alexandra Lassota, Krzysztof Sornat, Nimrod Talmon:
Aggregation of Continuous Preferences in One Dimension. IJCAI 2024: 2748-2756 - [i20]Alberto Del Pia:
The Mixed Integer Trust Region Problem. CoRR abs/2402.08827 (2024) - [i19]Alberto Del Pia:
Factorized binary polynomial optimization. CoRR abs/2407.03936 (2024) - 2023
- [j40]Alberto Del Pia, Silvia Di Gregorio:
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs. Algorithmica 85(8): 2189-2213 (2023) - [j39]Alberto Del Pia, Aida Khajavirad, Dmitriy Kunisky:
Linear Programming and Community Detection. Math. Oper. Res. 48(2): 885-913 (2023) - [j38]Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
Complexity, exactness, and rationality in polynomial optimization. Math. Program. 197(2): 661-692 (2023) - [j37]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. Math. Program. 197(2): 847-875 (2023) - [j36]Alberto Del Pia:
Sparse PCA on fixed-rank matrices. Math. Program. 198(1): 139-157 (2023) - [j35]Alberto Del Pia, Mingchen Ma:
k-median: exact recovery in the extended stochastic ball model. Math. Program. 200(1): 357-423 (2023) - [j34]Alberto Del Pia:
An approximation algorithm for indefinite mixed integer quadratic programming. Math. Program. 201(1): 263-293 (2023) - [e1]Alberto Del Pia, Volker Kaibel:
Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings. Lecture Notes in Computer Science 13904, Springer 2023, ISBN 978-3-031-32725-4 [contents] - [i18]Alberto Del Pia, Aida Khajavirad:
The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization. CoRR abs/2309.08693 (2023) - [i17]Alberto Del Pia:
Mixed Integer Convex Quadratic Programming is Fixed Parameter Tractable. CoRR abs/2311.00099 (2023) - [i16]Florent Capelli, Alberto Del Pia, Silvia Di Gregorio:
A Knowledge Compilation Take on Binary Polynomial Optimization. CoRR abs/2311.00149 (2023) - 2022
- [j33]Alberto Del Pia, Carla Michini:
Short Simplex Paths in Lattice Polytopes. Discret. Comput. Geom. 67(2): 503-524 (2022) - [j32]Alberto Del Pia, Mingchen Ma:
Proximity in concave integer quadratic programming. Math. Program. 194(1): 871-900 (2022) - [c13]Alberto Del Pia, Mingchen Ma, Christos Tzamos:
Clustering with Queries under Semi-Random Noise. COLT 2022: 5278-5313 - [c12]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
On the Complexity of Separation from the Knapsack Polytope. IPCO 2022: 168-180 - [c11]Alberto Del Pia, Matthias Walter:
Simple Odd β-Cycle Inequalities for Binary Polynomial Optimization. IPCO 2022: 181-194 - [c10]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
New Classes of Facets for Complementarity Knapsack Problems. ISCO 2022: 3-21 - [c9]Alberto Del Pia, Silvia Di Gregorio:
On the complexity of binary polynomial optimization over acyclic hypergraphs. SODA 2022: 2684-2699 - [i15]Alberto Del Pia:
Sparse PCA on fixed-rank matrices. CoRR abs/2201.02487 (2022) - [i14]Alberto Del Pia, Aida Khajavirad:
Rank-one Boolean tensor factorization and the multilinear polytope. CoRR abs/2202.07053 (2022) - [i13]Alberto Del Pia, Dekun Zhou:
An SDP Relaxation for the Sparse Integer Least Square Problem. CoRR abs/2203.02607 (2022) - [i12]Alberto Del Pia, Mingchen Ma, Christos Tzamos:
Clustering with Queries under Semi-Random Noise. CoRR abs/2206.04583 (2022) - [i11]Alberto Del Pia:
An Approximation Algorithm for Indefinite Mixed Integer Quadratic Programming. CoRR abs/2211.16442 (2022) - 2021
- [j31]Alberto Del Pia, Silvia Di Gregorio:
Chvátal Rank in Binary Polynomial Optimization. INFORMS J. Optim. 3(4): 315-349 (2021) - [j30]Alberto Del Pia, Aida Khajavirad:
The Running Intersection Relaxation of the Multilinear Polytope. Math. Oper. Res. 46(3): 1008-1037 (2021) - [j29]Alberto Del Pia, Dion Gijswijt, Jeff T. Linderoth, Haoran Zhu:
Integer packing sets form a well-quasi-ordering. Oper. Res. Lett. 49(2): 226-230 (2021) - [c8]Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
Complexity, Exactness, and Rationality in Polynomial Optimization. IPCO 2021: 58-72 - [c7]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. IPCO 2021: 193-207 - [i10]Alberto Del Pia, Matthias Walter:
Simple odd $β$-cycle inequalities for binary polynomial optimization. CoRR abs/2111.04858 (2021) - 2020
- [j28]Alberto Del Pia, Aida Khajavirad, Nikolaos V. Sahinidis:
On the impact of running intersection inequalities for globally solving polynomial optimization problems. Math. Program. Comput. 12(2): 165-191 (2020) - [j27]Alberto Del Pia, Santanu S. Dey, Robert Weismantel:
Subset Selection in Sparse Matrices. SIAM J. Optim. 30(2): 1173-1190 (2020) - [i9]Alberto Del Pia, Aida Khajavirad, Dmitriy Kunisky:
Linear Programming and Community Detection. CoRR abs/2006.03213 (2020) - [i8]Alberto Del Pia, Silvia Di Gregorio:
On the complexity of binary polynomial optimization over acyclic hypergraphs. CoRR abs/2007.05861 (2020)
2010 – 2019
- 2019
- [j26]Alberto Del Pia, Jeffrey Poskin:
Characterizations of mixed binary convex quadratic representable sets. Math. Program. 177(1-2): 371-394 (2019) - [j25]Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco S. Molinaro:
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. SIAM J. Optim. 29(1): 55-76 (2019) - [j24]Alberto Del Pia:
Subdeterminants and Concave Integer Quadratic Programming. SIAM J. Optim. 29(4): 3154-3173 (2019) - [i7]Alberto Del Pia, Carla Michini:
Short simplex paths in lattice polytopes. CoRR abs/1912.05712 (2019) - 2018
- [j23]Alberto Del Pia, Antoine Musitelli, Giacomo Zambelli:
On matrices with the Edmonds-Johnson property arising from bidirected graphs. J. Comb. Theory B 130: 49-91 (2018) - [j22]Alberto Del Pia, Aida Khajavirad:
On decomposability of Multilinear sets. Math. Program. 170(2): 387-415 (2018) - [j21]Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta:
Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171(1-2): 331-359 (2018) - [j20]Alberto Del Pia:
On approximation algorithms for concave mixed-integer quadratic programming. Math. Program. 172(1-2): 3-16 (2018) - [j19]Alberto Del Pia, Jeffrey Poskin:
Ellipsoidal mixed-integer representability. Math. Program. 172(1-2): 351-369 (2018) - [j18]Alberto Del Pia, Aida Khajavirad:
The Multilinear Polytope for Acyclic Hypergraphs. SIAM J. Optim. 28(2): 1049-1076 (2018) - [i6]Alberto Del Pia, Santanu S. Dey, Robert Weismantel:
Subset selection in sparse matrices. CoRR abs/1810.02757 (2018) - [i5]Alberto Del Pia:
Subdeterminants and Concave Integer Quadratic Programming. CoRR abs/1810.02763 (2018) - 2017
- [j17]Alberto Del Pia, Aida Khajavirad:
A Polyhedral Study of Binary Polynomial Programs. Math. Oper. Res. 42(2): 389-410 (2017) - [j16]Alberto Del Pia, Santanu S. Dey, Marco Molinaro:
Mixed-integer quadratic programming is in NP. Math. Program. 162(1-2): 225-240 (2017) - [c6]Alberto Del Pia, Michael Ferris, Carla Michini:
Totally Unimodular Congestion Games. SODA 2017: 577-588 - 2016
- [j15]Alberto Del Pia, Robert Weismantel:
Relaxations of mixed integer sets from lattice-free polyhedra. Ann. Oper. Res. 240(1): 95-117 (2016) - [j14]Alberto Del Pia, Carla Michini:
On the Diameter of Lattice Polytopes. Discret. Comput. Geom. 55(3): 681-687 (2016) - [j13]Alberto Del Pia, Robert Hildebrand, Robert Weismantel, Kevin Zemmer:
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane. Math. Oper. Res. 41(2): 511-530 (2016) - [c5]Alberto Del Pia:
On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming. IPCO 2016: 1-13 - [c4]Alberto Del Pia, Jeffrey Poskin:
On the Mixed Binary Representability of Ellipsoidal Regions. IPCO 2016: 214-225 - 2015
- [j12]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse split rank. Math. Program. 154(1-2): 273-303 (2015) - [j11]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29(1): 166-181 (2015) - [i4]Alberto Del Pia, Michael Ferris, Carla Michini:
Totally Unimodular Congestion Games. CoRR abs/1511.02784 (2015) - [i3]Alberto Del Pia, Carla Michini:
On the diameter of lattice polytopes. CoRR abs/1512.07872 (2015) - 2014
- [j10]Michele Conforti, Alberto Del Pia:
Disjunctive programming and relaxations of polyhedra. Math. Program. 144(1-2): 307-314 (2014) - [c3]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. IPCO 2014: 234-248 - [c2]Alberto Del Pia, Robert Weismantel:
Integer quadratic programming in the plane. SODA 2014: 840-846 - [i2]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. CoRR abs/1407.2034 (2014) - [i1]Alberto Del Pia, Santanu S. Dey, Marco Molinaro:
Mixed-integer Quadratic Programming is in NP. CoRR abs/1407.4798 (2014) - 2013
- [j9]Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. 27(3): 1492-1502 (2013) - [c1]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. IPCO 2013: 133-144 - 2012
- [j8]Alberto Del Pia, Robert Weismantel:
Relaxations of mixed integer sets from lattice-free polyhedra. 4OR 10(3): 221-244 (2012) - [j7]Alberto Del Pia:
On the Rank of Disjunctive Cuts. Math. Oper. Res. 37(2): 372-378 (2012) - [j6]Michel Baes, Alberto Del Pia, Yurii E. Nesterov, Shmuel Onn, Robert Weismantel:
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. Math. Program. 134(1): 305-322 (2012) - [j5]Alberto Del Pia, Robert Weismantel:
On convergence in mixed integer programming. Math. Program. 135(1-2): 397-412 (2012) - 2011
- [j4]Alberto Del Pia, Christian Wagner, Robert Weismantel:
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts. Oper. Res. Lett. 39(4): 234-240 (2011) - 2010
- [j3]Alberto Del Pia:
On matrices with the Edmonds-Johnson property. 4OR 8(1): 105-108 (2010)
2000 – 2009
- 2009
- [j2]Alberto Del Pia, Giacomo Zambelli:
Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank. SIAM J. Discret. Math. 23(3): 1281-1296 (2009) - 2006
- [j1]Alberto Del Pia, Carlo Filippi:
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int. Trans. Oper. Res. 13(2): 125-141 (2006)
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-21 21:33 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:
