Daniele Manerba

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
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

2020
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

2019
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

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

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

2015
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

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

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


  Loading...