default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Antonio Boschetti
Person information
- affiliation: University of Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Marco Antonio Boschetti
, Stefano Novellani:
Last-mile delivery with drone and lockers. Networks 83(2): 213-235 (2024)- 2023
- [j22]Marco A. Boschetti, Adam N. Letchford, Vittorio Maniezzo:
Matheuristics: survey and synthesis. Int. Trans. Oper. Res. 30(6): 2840-2866 (2023) - [j21]Giacomo Frisoni, Paolo Italiani, Gianluca Moro, Ilaria Bartolini, Marco Antonio Boschetti, Antonella Carbonaro:
Graph-Enhanced Biomedical Abstractive Summarization Via Factual Evidence Extraction. SN Comput. Sci. 4(5): 500 (2023) - 2022
- [j20]Marco Antonio Boschetti, Vittorio Maniezzo:
Matheuristics: using mathematics for heuristic design. 4OR 20(2): 173-208 (2022) - [c4]Vittorio Maniezzo, Marco A. Boschetti, Pietro Manzoni:
Self-adaptive Publish/Subscribe Network Design. MIC 2022: 478-484
2010 – 2019
- 2019
- [j19]Marco Antonio Boschetti, Vittorio Maniezzo, Francesco Strappaveccia:
Membership overlay design optimization with resource constraints (accelerated on GPU). J. Parallel Distributed Comput. 133: 286-296 (2019) - [j18]Vittorio Maniezzo, Marco A. Boschetti, Antonella Carbonaro, Moreno Marzolla, Francesco Strappaveccia:
Client-side Computational Optimization. ACM Trans. Math. Softw. 45(2): 19:1-19:16 (2019) - 2017
- [j17]Marco A. Boschetti, Vittorio Maniezzo, Francesco Strappaveccia:
Route relaxations on GPU for vehicle routing problems. Eur. J. Oper. Res. 258(2): 456-466 (2017) - 2016
- [j16]Marco A. Boschetti, Vittorio Maniezzo, Francesco Strappaveccia:
Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem. INFORMS J. Comput. 28(3): 540-552 (2016) - 2015
- [j15]Marco A. Boschetti, Vittorio Maniezzo:
A set covering based matheuristic for a real-world city logistics problem. Int. Trans. Oper. Res. 22(1): 169-195 (2015) - 2014
- [j14]Marco A. Boschetti, Matteo Golfarelli, Stefano Rizzi, Elisa Turricchia:
A Lagrangian heuristic for sprint planning in agile software development. Comput. Oper. Res. 43: 116-128 (2014) - [j13]Roberto Baldacci, Marco A. Boschetti, Maurizio Ganovelli, Vittorio Maniezzo:
Algorithms for nesting with defects. Discret. Appl. Math. 163: 17-33 (2014) - 2011
- [j12]Marco A. Boschetti, Vittorio Maniezzo, Matteo Roffilli:
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem. INFORMS J. Comput. 23(1): 90-104 (2011) - 2010
- [j11]Marco Antonio Boschetti, Lorenza Montaletti:
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem. Oper. Res. 58(6): 1774-1791 (2010) - [c3]Antonio Bolufé Röhler, Marco A. Boschetti, Vittorio Maniezzo:
Soft Variable Fixing in Path Relinking: An Application to ACO Codes. ANTS Conference 2010: 576-577 - [p1]Marco A. Boschetti, Vittorio Maniezzo, Matteo Roffilli:
Decomposition Techniques as Metaheuristic Frameworks. Matheuristics 2010: 135-158
2000 – 2009
- 2009
- [j10]Roberto Baldacci, Marco A. Boschetti, Nicos Christofides, Simon Christofides:
Exact methods for large-scale multi-period financial planning problems. Comput. Manag. Sci. 6(3): 281-306 (2009) - [j9]Marco A. Boschetti, Vittorio Maniezzo:
Benders decomposition, Lagrangean relaxation and metaheuristic design. J. Heuristics 15(3): 283-312 (2009) - [c2]Marco A. Boschetti, Vittorio Maniezzo, Matteo Roffilli, Antonio Bolufé Röhler:
Matheuristics: Optimization, Simulation and Control. Hybrid Metaheuristics 2009: 171-177 - 2008
- [j8]Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli:
A dual ascent procedure for the set partitioning problem. Discret. Optim. 5(4): 735-747 (2008) - 2007
- [j7]Roberto Baldacci, Marco A. Boschetti:
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. Eur. J. Oper. Res. 183(3): 1136-1149 (2007) - 2004
- [j6]Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli:
An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem. Ann. Oper. Res. 127(1-4): 177-201 (2004) - [j5]Marco A. Boschetti:
New lower bounds for the three-dimensional finite bin packing problem. Discret. Appl. Math. 140(1-3): 241-258 (2004) - [c1]Vittorio Maniezzo, Marco A. Boschetti, Márk Jelasity:
An Ant Approach to Membership Overlay Design. ANTS Workshop 2004: 37-48 - 2003
- [j4]Marco A. Boschetti, Aristide Mingozzi:
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR 1(1): 27-42 (2003) - [j3]Marco A. Boschetti, Aristide Mingozzi:
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 4OR 1(2): 135-147 (2003)
1990 – 1999
- 1999
- [j2]Aristide Mingozzi, Marco A. Boschetti, Salvatore Ricciardelli, Lucio Bianco:
A Set Partitioning Approach to the Crew Scheduling Problem. Oper. Res. 47(6): 873-888 (1999) - 1996
- [j1]C. G. Broyden, Marco A. Boschetti:
A Comparison of Three Basic Conjugate Direction Methods. Numer. Linear Algebra Appl. 3(6): 473-489 (1996)
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 20:30 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:
