default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Tadei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j49]Riccardo Giusti
, Daniele Manerba, Teodor Gabriel Crainic, Roberto Tadei:
The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules. Comput. Oper. Res. 158: 106282 (2023)- 2022
- [j48]Mina Roohnavazfar, Seyed Hamid Reza Pasandideh, Roberto Tadei:
A hybrid algorithm for the Vehicle Routing Problem with AND/OR Precedence Constraints and time windows. Comput. Oper. Res. 143: 105766 (2022) - 2021
- [j47]Mina Roohnavazfar, Daniele Manerba, Lohic Fotio Tiotsop, Seyed Hamid Reza Pasandideh, Roberto Tadei:
Stochastic single machine scheduling problem as a multi-stage dynamic random decision process. Comput. Manag. Sci. 18(3): 267-297 (2021) - [j46]Raslan Kain, Daniele Manerba, Roberto Tadei:
The index selection problem with configurations and memory limitation: A scatter search approach. Comput. Oper. Res. 133: 105385 (2021) - [j45]Riccardo Giusti, Daniele Manerba, Roberto Tadei:
Multiperiod transshipment location-allocation problem with flow synchronization under stochastic handling operations. Networks 78(1): 88-104 (2021) - [c14]Ilaria Gioda, Davide Caputo, Edoardo Fadda, Daniele Manerba, Blanca Silva Fernández, Roberto Tadei:
Solving assignment problems via Quantum Computing: a case-study in train seating arrangement. FedCSIS 2021: 217-220 - 2020
- [j44]Roberto Tadei, Guido Perboli, Daniele Manerba:
The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities. Optim. Lett. 14(5): 1207-1218 (2020) - [j43]Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba, Roberto Tadei:
The Stochastic Multipath Traveling Salesman Problem with Dependent Random Travel Costs. Transp. Sci. 54(5): 1372-1387 (2020) - [c13]Yuanyuan Li, Klodiana Goga, Roberto Tadei, Olivier Terzo:
Production Scheduling in Industry 4.0. CISIS 2020: 355-364 - [c12]Yuanyuan Li, Edoardo Fadda, Daniele Manerba, Mina Roohnavazfar, Roberto Tadei, Olivier Terzo:
Online Single-Machine Scheduling via Reinforcement Learning. WCO@FedCSIS 2020: 103-122 - [c11]Yuanyuan Li, Edoardo Fadda, Daniele Manerba, Roberto Tadei, Olivier Terzo:
Reinforcement Learning Algorithms for Online Single-Machine Scheduling. FedCSIS 2020: 277-283
2010 – 2019
- 2019
- [j42]Mauro Maria Baldi, Daniele Manerba, Guido Perboli, Roberto Tadei:
A Generalized Bin Packing Problem for parcel delivery in last-mile logistics. Eur. J. Oper. Res. 274(3): 990-999 (2019) - [j41]Edoardo Fadda, Guido Perboli, Roberto Tadei:
A progressive hedging method for the optimization of social engagement and opportunistic IoT problems. Eur. J. Oper. Res. 277(2): 643-652 (2019) - [c10]Edoardo Fadda, Daniele Manerba, Roberto Tadei, Paolo Camurati, Gianpiero Cabodi:
KPIs for Optimal Location of charging stations for Electric Vehicles: the Biella case-study. FedCSIS 2019: 123-126 - 2018
- [j40]Edoardo Fadda, Guido Perboli, Roberto Tadei:
Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT. Comput. Oper. Res. 93: 41-50 (2018) - [j39]Guido Perboli, Roberto Tadei, Edoardo Fadda:
New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem. Electron. Notes Discret. Math. 64: 75-84 (2018) - [j38]Edoardo Fadda, Luca Gobbato, Guido Perboli, Mariangela Rosano, Roberto Tadei:
Waste Collection in Urban Areas: A Case Study. Interfaces 48(4): 307-322 (2018) - 2017
- [j37]Roberto Tadei, Guido Perboli, Francesca Perfetti:
The multi-path Traveling Salesman Problem with stochastic travel costs. EURO J. Transp. Logist. 6(1): 3-23 (2017) - [c9]Edoardo Fadda, Dario Mana, Guido Perboli, Roberto Tadei:
Multi Period Assignment Problem for Social Engagement and Opportunistic IoT. COMPSAC (2) 2017: 760-765 - 2016
- [c8]Mauro Maria Baldi, Guido Perboli, Roberto Tadei:
Driver Maneuvers Inference Through Machine Learning. MOD 2016: 182-192 - [c7]Roberto Tadei, Edoardo Fadda, Luca Gobbato, Guido Perboli, Mariangela Rosano:
An ICT-Based Reference Model for E-grocery in Smart Cities. Smart-CT 2016: 22-31 - 2014
- [j36]Mauro Maria Baldi, Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei:
Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items. Ann. Oper. Res. 222(1): 125-141 (2014) - [j35]Guido Perboli, Roberto Tadei, Luca Gobbato:
The Multi-Handler Knapsack Problem under Uncertainty. Eur. J. Oper. Res. 236(3): 1000-1007 (2014) - 2013
- [j34]Renata E. Onety, Roberto Tadei, Oriane M. Neto, Ricardo H. C. Takahashi:
Multiobjective optimization of MPLS-IP networks with a variable neighborhood genetic algorithm. Appl. Soft Comput. 13(11): 4403-4412 (2013) - [c6]Franziska Heinicke, Axel Simroth, Roberto Tadei, Mauro Maria Baldi:
Job Order Assignment at Optimal Costs in Railway Maintenance. ICORES 2013: 304-309 - 2012
- [j33]Mauro Maria Baldi, Guido Perboli, Roberto Tadei:
The three-dimensional knapsack problem with balancing constraints. Appl. Math. Comput. 218(19): 9802-9818 (2012) - [j32]Guido Perboli, Roberto Tadei, Mauro Maria Baldi:
The stochastic generalized bin packing problem. Discret. Appl. Math. 160(7-8): 1291-1297 (2012) - [j31]Roberto Tadei, Guido Perboli, Nicoletta Ricciardi, Mauro Maria Baldi:
The capacitated transshipment location problem with stochastic handling utilities at the facilities. Int. Trans. Oper. Res. 19(6): 789-807 (2012) - 2011
- [j30]Teodor Gabriel Crainic, Guido Perboli, Walter Rei, Roberto Tadei:
Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput. Oper. Res. 38(11): 1474-1482 (2011) - [j29]Guido Perboli, Roberto Tadei, Daniele Vigo:
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics. Transp. Sci. 45(3): 364-380 (2011) - [c5]Guido Perboli, Teodor Gabriel Crainic, Roberto Tadei:
An efficient metaheuristic for multi-dimensional multi-container packing. CASE 2011: 563-568 - [c4]Teodor Gabriel Crainic, Simona Mancini, Guido Perboli, Roberto Tadei:
Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem. EvoCOP 2011: 179-190 - 2010
- [j28]Guido Perboli, Roberto Tadei:
New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem. Electron. Notes Discret. Math. 36: 639-646 (2010)
2000 – 2009
- 2009
- [j27]Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei:
TS2PACK: A two-level tabu search for the three-dimensional bin packing problem. Eur. J. Oper. Res. 195(3): 744-760 (2009) - [j26]Roberto Tadei, Nicoletta Ricciardi, Guido Perboli:
The stochastic p-median problem with unknown cost probability distribution. Oper. Res. Lett. 37(2): 135-141 (2009) - 2008
- [j25]Roberto Tadei, Nicola Bellomo:
Special issue on modeling and computational methods in genomic sciences. Comput. Math. Appl. 55(5): 863-866 (2008) - [j24]Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei:
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing. INFORMS J. Comput. 20(3): 368-384 (2008) - [j23]Guido Perboli, Ferdinando Pezzella, Roberto Tadei:
EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem. Math. Methods Oper. Res. 68(2): 361-382 (2008) - 2007
- [j22]Teodor Gabriel Crainic, Guido Perboli, Miriam Pezzuto, Roberto Tadei:
New bin packing fast lower bounds. Comput. Oper. Res. 34(11): 3439-3457 (2007) - [j21]Teodor Gabriel Crainic, Guido Perboli, Miriam Pezzuto, Roberto Tadei:
Computing the asymptotic worst-case of bin packing lower bounds. Eur. J. Oper. Res. 183(3): 1295-1303 (2007) - [j20]Luigi De Giovanni, Roberto Tadei:
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints. Networks 49(1): 65-79 (2007) - 2004
- [j19]F. Bellanti, Giuliana Carello, Federico Della Croce, Roberto Tadei:
A greedy-based neighborhood search approach to a nurse rostering problem. Eur. J. Oper. Res. 153(1): 28-40 (2004) - [j18]Federico Della Croce, Marco Ghirardi, Roberto Tadei:
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems. J. Heuristics 10(1): 89-104 (2004) - [j17]Stefano Pallottino, Roberto Tadei:
Foreword. Networks 44(2): 59-60 (2004) - [j16]Luigi De Giovanni, Federico Della Croce, Roberto Tadei:
On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints. Networks 44(2): 73-83 (2004) - [j15]Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei:
Solving the Hub location problem in telecommunication network design: A local search approach. Networks 44(2): 94-105 (2004) - [j14]Andrea Grosso, Federico Della Croce, Roberto Tadei:
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32(1): 68-72 (2004) - 2002
- [j13]Nicoletta Ricciardi, Roberto Tadei, Andrea Grosso:
Optimal facility location with random throughput costs. Comput. Oper. Res. 29(6): 593-607 (2002) - [j12]Roberto Tadei, Andrea Grosso, Federico Della Croce:
Finding the Pareto-optima for the total and maximum tardiness single machine problem. Discret. Appl. Math. 124(1-3): 117-126 (2002) - [j11]Federico Della Croce, Marco Ghirardi, Roberto Tadei:
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. Eur. J. Oper. Res. 139(2): 293-301 (2002) - [j10]Roberto Tadei, Guido Perboli, Federico Della Croce:
A Heuristic Algorithm for the Auto-Carrier Transportation Problem. Transp. Sci. 36(1): 55-62 (2002) - 2001
- [j9]Marin Litoiu, Roberto Tadei:
Real-time task scheduling with fuzzy deadlines and processing times. Fuzzy Sets Syst. 117(1): 35-45 (2001) - [j8]Marin Litoiu, Roberto Tadei:
Fuzzy scheduling with application to real-time systems. Fuzzy Sets Syst. 121(3): 523-535 (2001) - 2000
- [j7]Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei:
Minimizing tardy jobs in a flowshop with common due date. Eur. J. Oper. Res. 120(2): 375-381 (2000)
1990 – 1999
- 1999
- [j6]Federico Della Croce, Roberto Tadei, P. S. Asioli:
Scheduling a round robin tennis tournamentunder courts and players availability constraints. Ann. Oper. Res. 92: 349-361 (1999) - [j5]Roberto Tadei, Nicoletta Ricciardi:
The dynamic multilevel assignment problem as a stochastic extremal process. Eur. J. Oper. Res. 117(2): 264-274 (1999) - 1998
- [j4]Roberto Tadei, Jatinder N. D. Gupta, Federico Della Croce, M. Cortesi:
Minimising makespan in the two-machine flow-shop with release times. J. Oper. Res. Soc. 49(1): 77-85 (1998) - [j3]Federico Della Croce, Roberto Tadei, Paolo Baracco, Andrea Grosso:
A new decomposition approach for the single machine total tardiness scheduling problem. J. Oper. Res. Soc. 49(10): 1101-1106 (1998) - 1997
- [j2]Marin Litoiu, Roberto Tadei:
Real time task scheduling allowing fuzzy due dates. Eur. J. Oper. Res. 100(3): 475-481 (1997) - 1995
- [j1]Federico Della Croce, Roberto Tadei, Giuseppe Volta:
A genetic algorithm for the job shop problem. Comput. Oper. Res. 22(1): 15-24 (1995) - 1994
- [c3]Giuseppe Menga, Roberto Tadei, M. Trubian, Giuseppe Volta, Federico Della Croce:
Production Scheduling for Perishable Goods: A Case Study. ICRA 1994: 507-512 - 1993
- [c2]Federico Della Croce, Roberto Tadei, Paolo Baracco, Raffaele Di Tullio:
On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine. ICRA (3) 1993: 816-820 - 1992
- [c1]Federico Della Croce, Giuseppe Menga, Roberto Tadei, M. Cavalotto, L. Petri:
Cellular control of flexible manufacturing systems. ICRA 1992: 937-948
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
