Daniele Manerba

According to our database1, Daniele Manerba authored at least 17 papers between 2012 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


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

The index selection problem with configurations and memory limitation: A scatter search approach.
Comput. Oper. Res., 2021

Stochastic single machine scheduling problem as a multi-stage dynamic random decision process.
Comput. Manag. Sci., 2021

Solving assignment problems via Quantum Computing: a case-study in train seating arrangement.
Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

The Stochastic Multipath Traveling Salesman Problem with Dependent Random Travel Costs.
Transp. Sci., 2020

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

Reinforcement Learning Algorithms for Online Single-Machine Scheduling.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

Online Single-Machine Scheduling via Reinforcement Learning.
Proceedings of the Recent Advances in Computational Optimization, 2020

A Generalized Bin Packing Problem for parcel delivery in last-mile logistics.
Eur. J. Oper. Res., 2019

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

KPIs for Optimal Location of charging stations for Electric Vehicles: the Biella case-study.
Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019

The Traveling Purchaser Problem and its variants.
Eur. J. Oper. Res., 2017

The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach.
Eur. J. Oper. Res., 2016

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

Optimization models and algorithms for problems in procurement logistics.
4OR, 2015

An effective matheuristic for the capacitated total quantity discount problem.
Comput. Oper. Res., 2014

An exact algorithm for the Capacitated Total Quantity Discount Problem.
Eur. J. Oper. Res., 2012