Követés
Monaldo Mastrolilli
Monaldo Mastrolilli
IDSIA
E-mail megerősítve itt: idsia.ch - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Effective neighbourhood functions for the flexible job shop problem
M Mastrolilli, LM Gambardella
Journal of scheduling 3 (1), 3-20, 2000
7482000
A comparison of the performance of different metaheuristics on the timetabling problem
O Rossi-Doria, M Sampels, M Birattari, M Chiarandini, M Dorigo, ...
Practice and Theory of Automated Timetabling IV: 4th International …, 2003
3032003
An optimization methodology for intermodal terminal management
LM Gambardella, M Mastrolilli, AE Rizzoli, M Zaffalon
Journal of Intelligent Manufacturing 12 (5), 521-534, 2001
1902001
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
L Bianchi, M Birattari, M Chiarandini, M Manfrin, M Mastrolilli, L Paquete, ...
Journal of Mathematical Modelling and Algorithms 5, 91-110, 2006
1832006
Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling
C Ambuhl, M Mastrolilli, O Svensson
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 329-337, 2007
169*2007
The robust traveling salesman problem with interval data
R Montemanni, J Barta, M Mastrolilli, LM Gambardella
Transportation Science 41 (3), 366-381, 2007
1282007
Metaheuristics for the vehicle routing problem with stochastic demands
L Bianchi, M Birattari, M Chiarandini, M Manfrin, M Mastrolilli, L Paquete, ...
Parallel Problem Solving from Nature-PPSN VIII: 8th International Conference …, 2004
1022004
Minimizing the sum of weighted completion times in a concurrent open shop
M Mastrolilli, M Queyranne, AS Schulz, O Svensson, NA Uhan
Operations Research Letters 38 (5), 390-395, 2010
1002010
Approximation schemes for job shop scheduling problems with controllable processing times
K Jansen, M Mastrolilli, R Solis-Oba
European journal of operational research 167 (2), 297-319, 2005
862005
Efficient approximation schemes for scheduling problems with release dates and delivery times
M Mastrolilli
Journal of Scheduling 6 (6), 521-531, 2003
772003
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
C Ambühl, M Mastrolilli
Algorithmica 53 (4), 488-503, 2009
702009
On the approximability of single-machine scheduling with precedence constraints
C Ambühl, M Mastrolilli, N Mutsanas, O Svensson
Mathematics of Operations Research 36 (4), 653-669, 2011
64*2011
Approximation algorithms for flexible job shop problems
K Jansen, M Mastrolilli, R Solis-Oba
LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000
622000
Grouping techniques for scheduling problems: Simpler and faster
AV Fishkin, K Jansen, M Mastrolilli
Algorithmica 51 (2), 183-199, 2008
56*2008
Approximation schemes for parallel machine scheduling problems with controllable processing times
K Jansen, M Mastrolilli
Computers & Operations Research 31 (10), 1565-1581, 2004
562004
How to sell hyperedges: The hypermatching assignment problem
M Cygan, F Grandoni, M Mastrolilli
Proceedings of the twenty-fourth annual acm-siam symposium on discrete …, 2013
502013
Resource allocation and scheduling of operations in an intermodal terminal
M Zaffalon, AE Rizzoli, LM Gambardella, M Mastrolilli
ESS98, 10th European Simulation Symposium and Exhibition, Simulation in …, 1998
451998
Single machine scheduling with scenarios
M Mastrolilli, N Mutsanas, O Svensson
Theoretical Computer Science 477, 57-66, 2013
42*2013
Hardness of approximating flow and job shop scheduling problems
M Mastrolilli, O Svensson
Journal of the ACM (JACM) 58 (5), 1-32, 2011
42*2011
Hybridizations of metaheuristics with branch & bound derivates
C Blum, C Cotta, AJ Fernández, JE Gallardo, M Mastrolilli
Hybrid metaheuristics: an emerging approach to optimization, 85-116, 2008
412008
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20