default search action
Daniele Manerba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Pierluigi Bontempi, Daniele Manerba, Alexandre D'Hooge, Sergio Canazza:
From MIDI to Rich Tablatures: an Automatic Generative System incorporating Lead Guitarists' Fingering and Stylistic choices. CoRR abs/2407.09052 (2024) - 2023
- [j15]Riccardo Giusti
, Daniele Manerba
The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules. Comput. Oper. Res. 158: 106282 (2023) - [j14]Alessandro Gobbi
Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand. Int. Trans. Oper. Res. 30(1): 8-38 (2023) - 2022
- [c6]Michel Bierlaire, Edoardo Fadda
A chance-constraint approach for optimizing social engagement-based services. FedCSIS 2022: 301-304 - [c5]Michel Bierlaire, Edoardo Fadda
Workforce Allocation for Social Engagement Services via Stochastic Optimization. WCO 2022: 71-87 - 2021
- [j13]Mina Roohnavazfar, Daniele Manerba
Stochastic single machine scheduling problem as a multi-stage dynamic random decision process. Comput. Manag. Sci. 18(3): 267-297 (2021) - [j12]Raslan Kain
The index selection problem with configurations and memory limitation: A scatter search approach. Comput. Oper. Res. 133: 105385 (2021) - [j11]Riccardo Giusti
Multiperiod transshipment location-allocation problem with flow synchronization under stochastic handling operations. Networks 78(1): 88-104 (2021) - [c4]Ilaria Gioda, Davide Caputo, Edoardo Fadda
Solving assignment problems via Quantum Computing: a case-study in train seating arrangement. FedCSIS 2021: 217-220 - 2020
- [j10]Roberto Tadei
The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities. Optim. Lett. 14(5): 1207-1218 (2020) - [j9]Edoardo Fadda
The Stochastic Multipath Traveling Salesman Problem with Dependent Random Travel Costs. Transp. Sci. 54(5): 1372-1387 (2020) - [c3]Yuanyuan Li, Edoardo Fadda
Online Single-Machine Scheduling via Reinforcement Learning. WCO@FedCSIS 2020: 103-122 - [c2]Yuanyuan Li, Edoardo Fadda
Reinforcement Learning Algorithms for Online Single-Machine Scheduling. FedCSIS 2020: 277-283
2010 – 2019
- 2019
- [j8]Daniele Manerba
New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty. Comput. Oper. Res. 101: 29-42 (2019) - [j7]Mauro Maria Baldi
A Generalized Bin Packing Problem for parcel delivery in last-mile logistics. Eur. J. Oper. Res. 274(3): 990-999 (2019) - [c1]Edoardo Fadda
KPIs for Optimal Location of charging stations for Electric Vehicles: the Biella case-study. FedCSIS 2019: 123-126 - 2017
- [j6]Daniele Manerba
The Traveling Purchaser Problem and its variants. Eur. J. Oper. Res. 259(1): 1-18 (2017) - 2016
- [j5]Michel Gendreau
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach. Eur. J. Oper. Res. 248(1): 59-71 (2016) - 2015
- [j4]Daniele Manerba
Optimization models and algorithms for problems in procurement logistics. 4OR 13(3): 339-340 (2015) - [j3]Daniele Manerba
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2): 139-154 (2015) - 2014
- [j2]Daniele Manerba
An effective matheuristic for the capacitated total quantity discount problem. Comput. Oper. Res. 41: 1-11 (2014) - 2012
- [j1]Daniele Manerba
An exact algorithm for the Capacitated Total Quantity Discount Problem. Eur. J. Oper. Res. 222(2): 287-300 (2012)
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-08-16 18:32 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: