Daniele Manerba

According to our database, Daniele Manerba authored at least 21 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules.

Riccardo Giusti, Daniele Manerba, Teodor Gabriel Crainic, Roberto Tadei

Comput. Oper. Res., October, 2023

Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand.

Alessandro Gobbi, Daniele Manerba, Renata Mansini, Roberto Zanotti

Int. Trans. Oper. Res., 2023

2022

Workforce Allocation for Social Engagement Services via Stochastic Optimization.

Michel Bierlaire, Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba

Proceedings of the Recent Advances in Computational Optimization - Selected Papers from the WCO 2022, 2022

A chance-constraint approach for optimizing social engagement-based services.

Michel Bierlaire, Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba

Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022

2021

Multiperiod transshipment location-allocation problem with flow synchronization under stochastic handling operations.

Riccardo Giusti, Daniele Manerba, Roberto Tadei

Networks, 2021

The index selection problem with configurations and memory limitation: A scatter search approach.

Raslan Kain, Daniele Manerba, Roberto Tadei

Comput. Oper. Res., 2021

Stochastic single machine scheduling problem as a multi-stage dynamic random decision process.

Mina Roohnavazfar, Daniele Manerba, Lohic Fotio Tiotsop, Seyed Hamid Reza Pasandideh, Roberto Tadei

Comput. Manag. Sci., 2021

Solving assignment problems via Quantum Computing: a case-study in train seating arrangement.

Ilaria Gioda, Davide Caputo, Edoardo Fadda, Daniele Manerba, Blanca Silva Fernández, Roberto Tadei

Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

2020

The Stochastic Multipath Traveling Salesman Problem with Dependent Random Travel Costs.

Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba, Roberto Tadei

Transp. Sci., 2020

The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities.

Roberto Tadei, Guido Perboli, Daniele Manerba

Optim. Lett., 2020

Reinforcement Learning Algorithms for Online Single-Machine Scheduling.

Yuanyuan Li, Edoardo Fadda, Daniele Manerba, Roberto Tadei, Olivier Terzo

Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

Online Single-Machine Scheduling via Reinforcement Learning.

Yuanyuan Li, Edoardo Fadda, Daniele Manerba, Mina Roohnavazfar, Roberto Tadei, Olivier Terzo

Proceedings of the Recent Advances in Computational Optimization, 2020

2019

A Generalized Bin Packing Problem for parcel delivery in last-mile logistics.

Mauro Maria Baldi, Daniele Manerba, Guido Perboli, Roberto Tadei

Eur. J. Oper. Res., 2019

New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty.

Daniele Manerba, Guido Perboli

Comput. Oper. Res., 2019

KPIs for Optimal Location of charging stations for Electric Vehicles: the Biella case-study.

Edoardo Fadda, Daniele Manerba, Roberto Tadei, Paolo Camurati, Gianpiero Cabodi

Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019

2017

The Traveling Purchaser Problem and its variants.

Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma

Eur. J. Oper. Res., 2017

2016

The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach.

Michel Gendreau, Daniele Manerba, Renata Mansini

Eur. J. Oper. Res., 2016

2015

A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints.

Daniele Manerba, Renata Mansini

Networks, 2015

Optimization models and algorithms for problems in procurement logistics.

Daniele Manerba

4OR, 2015

2014

An effective matheuristic for the capacitated total quantity discount problem.

Daniele Manerba, Renata Mansini

Comput. Oper. Res., 2014

2012

An exact algorithm for the Capacitated Total Quantity Discount Problem.

Daniele Manerba, Renata Mansini

Eur. J. Oper. Res., 2012