Roberto Tadei

According to our database1, Roberto Tadei authored at least 62 papers between 1992 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
A hybrid algorithm for the Vehicle Routing Problem with AND/OR Precedence Constraints and time windows.
Comput. Oper. Res., 2022

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

Production Scheduling in Industry 4.0.
Proceedings of the Complex, Intelligent and Software Intensive Systems, 2020

2019
A progressive hedging method for the optimization of social engagement and opportunistic IoT problems.
Eur. J. Oper. Res., 2019

A Generalized Bin Packing Problem for parcel delivery in last-mile logistics.
Eur. J. 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

2018
Waste Collection in Urban Areas: A Case Study.
Interfaces, 2018

New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem.
Electron. Notes Discret. Math., 2018

Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT.
Comput. Oper. Res., 2018

2017
The multi-path Traveling Salesman Problem with stochastic travel costs.
EURO J. Transp. Logist., 2017

Multi Period Assignment Problem for Social Engagement and Opportunistic IoT.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

2016
An ICT-Based Reference Model for E-grocery in Smart Cities.
Proceedings of the Smart Cities - First International Conference, Smart-CT 2016, Málaga, 2016

Driver Maneuvers Inference Through Machine Learning.
Proceedings of the Machine Learning, Optimization, and Big Data, 2016

2014
The Multi-Handler Knapsack Problem under Uncertainty.
Eur. J. Oper. Res., 2014

Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items.
Ann. Oper. Res., 2014

2013
Multiobjective optimization of MPLS-IP networks with a variable neighborhood genetic algorithm.
Appl. Soft Comput., 2013

Job Order Assignment at Optimal Costs in Railway Maintenance.
Proceedings of the ICORES 2013, 2013

2012
The capacitated transshipment location problem with stochastic handling utilities at the facilities.
Int. Trans. Oper. Res., 2012

The stochastic generalized bin packing problem.
Discret. Appl. Math., 2012

The three-dimensional knapsack problem with balancing constraints.
Appl. Math. Comput., 2012

2011
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics.
Transp. Sci., 2011

Efficient lower bounds and heuristics for the variable cost and size bin packing problem.
Comput. Oper. Res., 2011

Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

An efficient metaheuristic for multi-dimensional multi-container packing.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2011

2010
New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem.
Electron. Notes Discret. Math., 2010

2009
The stochastic p-median problem with unknown cost probability distribution.
Oper. Res. Lett., 2009

TS<sup>2</sup>PACK: A two-level tabu search for the three-dimensional bin packing problem.
Eur. J. Oper. Res., 2009

2008
EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem.
Math. Methods Oper. Res., 2008

Extreme Point-Based Heuristics for Three-Dimensional Bin Packing.
INFORMS J. Comput., 2008

Special issue on modeling and computational methods in genomic sciences.
Comput. Math. Appl., 2008

2007
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints.
Networks, 2007

Computing the asymptotic worst-case of bin packing lower bounds.
Eur. J. Oper. Res., 2007

New bin packing fast lower bounds.
Comput. Oper. Res., 2007

2004
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem.
Oper. Res. Lett., 2004

Foreword.
Networks, 2004

On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints.
Networks, 2004

Solving the Hub location problem in telecommunication network design: A local search approach.
Networks, 2004

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems.
J. Heuristics, 2004

A greedy-based neighborhood search approach to a nurse rostering problem.
Eur. J. Oper. Res., 2004

2002
A Heuristic Algorithm for the Auto-Carrier Transportation Problem.
Transp. Sci., 2002

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem.
Eur. J. Oper. Res., 2002

Finding the Pareto-optima for the total and maximum tardiness single machine problem.
Discret. Appl. Math., 2002

Optimal facility location with random throughput costs.
Comput. Oper. Res., 2002

2001
Real-time task scheduling with fuzzy deadlines and processing times.
Fuzzy Sets Syst., 2001

Fuzzy scheduling with application to real-time systems.
Fuzzy Sets Syst., 2001

2000
Minimizing tardy jobs in a flowshop with common due date.
Eur. J. Oper. Res., 2000

1999
The dynamic multilevel assignment problem as a stochastic extremal process.
Eur. J. Oper. Res., 1999

Scheduling a round robin tennis tournamentunder courts and players availability constraints.
Ann. Oper. Res., 1999

1998
Minimising makespan in the two-machine flow-shop with release times.
J. Oper. Res. Soc., 1998

A new decomposition approach for the single machine total tardiness scheduling problem.
J. Oper. Res. Soc., 1998

1997
Real time task scheduling allowing fuzzy due dates.
Eur. J. Oper. Res., 1997

1995
A genetic algorithm for the job shop problem.
Comput. Oper. Res., 1995

1994
Production Scheduling for Perishable Goods: A Case Study.
Proceedings of the 1994 International Conference on Robotics and Automation, 1994

1993
On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine.
Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

1992
Cellular control of flexible manufacturing systems.
Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992


  Loading...