Daniele Manerba

23 papers C 6Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2025 C conf
The price of customer presence in Attended Home Delivery with Customer Availability Profiles.
FedCSIS
Roberto Zanotti, Daniele Manerba, Renata Mansini
2024 J jnl
From MIDI to Rich Tablatures: an Automatic Generative System incorporating Lead Guitarists' Fingering and Stylistic choices.
CoRR
Pierluigi Bontempi, Daniele Manerba, Alexandre D'Hooge, Sergio Canazza
2023 J jnl
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.
Alessandro Gobbi, Daniele Manerba, Renata Mansini, Roberto Zanotti
2023 J jnl
The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules.
Comput. Oper. Res.
Riccardo Giusti, Daniele Manerba, Teodor Gabriel Crainic, Roberto Tadei
2022 C conf
A chance-constraint approach for optimizing social engagement-based services.
FedCSIS
Michel Bierlaire, Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba
2022 C conf
Workforce Allocation for Social Engagement Services via Stochastic Optimization.
WCO
Michel Bierlaire, Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba
2021 J jnl
Multiperiod transshipment location-allocation problem with flow synchronization under stochastic handling operations.
Networks
Riccardo Giusti, Daniele Manerba, Roberto Tadei
2021 C conf
Solving assignment problems via Quantum Computing: a case-study in train seating arrangement.
FedCSIS
Ilaria Gioda, Davide Caputo, Edoardo Fadda, Daniele Manerba, Blanca Silva Fernández, Roberto Tadei
2021 J jnl
Stochastic single machine scheduling problem as a multi-stage dynamic random decision process.
Comput. Manag. Sci.
Mina Roohnavazfar, Daniele Manerba, Lohic Fotio Tiotsop, Seyed Hamid Reza Pasandideh, Roberto Tadei
2021 J jnl
The index selection problem with configurations and memory limitation: A scatter search approach.
Comput. Oper. Res.
Raslan Kain, Daniele Manerba, Roberto Tadei
2020 — conf
Online Single-Machine Scheduling via Reinforcement Learning.
WCO@FedCSIS
YuanYuan Li, Edoardo Fadda, Daniele Manerba, Mina Roohnavazfar, Roberto Tadei, Olivier Terzo
2020 C conf
Reinforcement Learning Algorithms for Online Single-Machine Scheduling.
FedCSIS
YuanYuan Li, Edoardo Fadda, Daniele Manerba, Roberto Tadei, Olivier Terzo
2020 J jnl
The Stochastic Multipath Traveling Salesman Problem with Dependent Random Travel Costs.
Transp. Sci.
Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba, Roberto Tadei
2020 J jnl
The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities.
Optim. Lett.
Roberto Tadei, Guido Perboli, Daniele Manerba
2019 J jnl
A Generalized Bin Packing Problem for parcel delivery in last-mile logistics.
Eur. J. Oper. Res.
Mauro Maria Baldi, Daniele Manerba, Guido Perboli, Roberto Tadei
2019 C conf
KPIs for Optimal Location of charging stations for Electric Vehicles: the Biella case-study.
FedCSIS
Edoardo Fadda, Daniele Manerba, Roberto Tadei, Paolo Camurati, Gianpiero Cabodi
2019 J jnl
New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty.
Comput. Oper. Res.
Daniele Manerba, Guido Perboli
2017 J jnl
The Traveling Purchaser Problem and its variants.
Eur. J. Oper. Res.
Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma
2016 J jnl
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach.
Eur. J. Oper. Res.
Michel Gendreau, Daniele Manerba, Renata Mansini
2015 J jnl
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints.
Networks
Daniele Manerba, Renata Mansini
2015 J jnl
Optimization models and algorithms for problems in procurement logistics.
4OR
Daniele Manerba
2014 J jnl
An effective matheuristic for the capacitated total quantity discount problem.
Comput. Oper. Res.
Daniele Manerba, Renata Mansini
2012 J jnl
An exact algorithm for the Capacitated Total Quantity Discount Problem.
Eur. J. Oper. Res.
Daniele Manerba, Renata Mansini