Seguir
Tommaso Pastore
Título
Citado por
Citado por
Año
Structural damage detection and localization using decision tree ensemble and vibration data
G Mariniello, T Pastore, C Menna, P Festa, D Asprone
Computer‐Aided Civil and Infrastructure Engineering 36 (9), 1129-1149, 2021
652021
A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
M Alicastro, D Ferone, P Festa, S Fugaro, T Pastore
Computers & Operations Research 131, 105272, 2021
652021
Shortest paths on dynamic graphs: a survey
D Ferone, P Festa, A Napoletano, T Pastore
Pesquisa Operacional 37 (3), 487-508, 2017
252017
Topology optimization of stress-constrained structural elements using risk-factor approach
T Pastore, V Mercuri, C Menna, D Asprone, P Festa, F Auricchio
Computers & Structures 224, 2019
172019
A dynamic programming algorithm for solving the k-Color Shortest Path Problem
D Ferone, P Festa, S Fugaro, T Pastore
Optimization Letters 15 (6), 1973-1992, 2021
162021
Integrating Biased-randomized GRASP with Monte Carlo simulation for solving the vehicle routing problem with stochastic demands
P Festa, T Pastore, D Ferone, AA Juan, C Bayliss
2018 Winter Simulation Conference (WSC), 2989-3000, 2018
162018
Heuristics for the constrained incremental graph drawing problem
A Napoletano, A Martínez-Gavara, P Festa, T Pastore, R Martí
European Journal of Operational Research 274 (2), 710-729, 2019
132019
Layout-aware extreme learning machine to detect tendon malfunctions in prestressed concrete bridges using stress data
G Mariniello, T Pastore, D Asprone, E Cosenza
Automation in Construction 132, 103976, 2021
112021
The k-Color Shortest Path Problem
D Ferone, P Festa, T Pastore
Advances in Optimization and Decision Science for Society, Services and …, 2019
112019
Tabu search for min-max edge crossing in graphs
T Pastore, A Martínez-Gavara, A Napoletano, P Festa, R Martí
Computers & Operations Research 114, 104830, 2020
102020
Bézier-based biased random-key genetic algorithm to address printability constraints in the topology optimization of concrete structures
T Pastore, C Menna, D Asprone
Structural and Multidisciplinary Optimization 65 (2), 64, 2022
82022
A grasp for the minimum cost sat problem
G Felici, D Ferone, P Festa, A Napoletano, T Pastore
Learning and Intelligent Optimization: 11th International Conference, LION …, 2017
82017
Reoptimizing shortest paths: From state of the art to new recent perspectives
D Ferone, P Festa, A Napoletano, T Pastore
2016 18th International Conference on Transparent Optical Networks (ICTON), 1-5, 2016
62016
Seismic pre-dimensioning of irregular concrete frame structures: Mathematical formulation and implementation of a learn-heuristic algorithm
G Mariniello, T Pastore, A Bilotta, D Asprone, E Cosenza
Journal of Building Engineering 46, 103733, 2022
52022
On the shortest path problems with edge constraints
D Ferone, P Festa, S Fugaro, T Pastore
2020 22nd International Conference on Transparent Optical Networks (ICTON), 1-4, 2020
52020
Combining multiple loads in a topology optimization framework for digitally fabricated concrete structures
T Pastore, C Menna, D Asprone
Second RILEM International Conference on Concrete and Digital Fabrication …, 2020
52020
BIM-based design and setup of structural health monitoring systems
C Gragnaniello, G Mariniello, T Pastore, D Asprone
Automation in Construction 158, 105245, 2024
42024
Efficient GRASP solution approach for the Prisoner Transportation Problem
D Ferone, P Festa, T Pastore, MGC Resende
Computers & Operations Research 153, 106161, 2023
22023
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
D Ferone, P Festa, S Fugaro, T Pastore
Networks 81 (2), 204-219, 2023
22023
Toward a Holistic Rating System: An Attempt to Expand the Boundaries of Building Sustainability Using SDGs
P Vitale, V Alfano, T Pastore, C Menna, P Maffettone, D Asprone
Frontiers in Built Environment 7, 679014, 2021
22021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20