default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Caprara
- > Home > Persons > Alberto Caprara
Publications
- 2016
[j79]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
Bilevel Knapsack with Interdiction Constraints. INFORMS J. Comput. 28(2): 319-333 (2016)- 2014
- [j73]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Study on the Computational Complexity of the Bilevel Knapsack Problem. SIAM J. Optim. 24(2): 823-838 (2014) - [j72]Alberto Caprara, Fabio Furini
, Andrea Lodi, Mauro Mangia, Riccardo Rovatti, Gianluca Setti:
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics. IEEE Trans. Signal Process. 62(6): 1603-1612 (2014) - 2013
- [c37]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO 2013: 98-109 - 2012
- [j66]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135(1-2): 369-395 (2012) - 2010
- [j58]Alberto Caprara, Andrea Lodi, Michele Monaci:
An approximation scheme for the two-stage, two-dimensional knapsack problem. Discret. Optim. 7(3): 114-124 (2010) - [c27]Federico Bizzarri, Christoph Buchheim, Sergio Callegari, Alberto Caprara, Andrea Lodi, Riccardo Rovatti, Gianluca Setti:
Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. CSDM 2010: 149-160 - [c26]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO 2010: 285-298 - 2006
- [j44]Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci:
Packing into the smallest square: Worst-case analysis of lower bounds. Discret. Optim. 3(4): 317-326 (2006) - 2005
- [j40]Alberto Caprara, Andrea Lodi, Michele Monaci:
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005) - 2004
- [j35]Alberto Caprara, Andrea Lodi, Romeo Rizzi:
On d-threshold graphs and d-dimensional bin packing. Networks 44(4): 266-280 (2004) - 2002
- [c13]Alberto Caprara, Andrea Lodi, Michele Monaci:
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328
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-04-24 22:53 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:
