Search the dblp DataBase
Monaldo Mastrolilli :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Monaldo Mastrolilli , Luca Maria Gambardella MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? [Citation Graph (0, 0)][DBLP ] AAAI, 2004, pp:173-178 [Conf ] Christoph Ambühl , Monaldo Mastrolilli , Ola Svensson Approximating Precedence-Constrained Single Machine Scheduling by Coloring. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2006, pp:15-26 [Conf ] Christoph Ambühl , Monaldo Mastrolilli Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:28-39 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Monaldo Mastrolilli Grouping Techniques for Scheduling Problems: Simpler and Faster. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:206-217 [Conf ] Monaldo Mastrolilli Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. [Citation Graph (0, 0)][DBLP ] FCT, 2001, pp:525-534 [Conf ] Monaldo Mastrolilli Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:49-60 [Conf ] Monaldo Mastrolilli Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2001, pp:268-279 [Conf ] Klaus Jansen , Monaldo Mastrolilli Parallel Machine Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP ] ICALP Satellite Workshops, 2000, pp:179-190 [Conf ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Job Shop Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:107-122 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Monaldo Mastrolilli On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. [Citation Graph (0, 0)][DBLP ] ISAAC, 2003, pp:319-328 [Conf ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Approximation Algorithms for Flexible Job Shop Problems. [Citation Graph (0, 0)][DBLP ] LATIN, 2000, pp:68-77 [Conf ] Olivia Rossi-Doria , Michael Sampels , Mauro Birattari , Marco Chiarandini , Marco Dorigo , Luca Maria Gambardella , Joshua D. Knowles , Max Manfrin , Monaldo Mastrolilli , Ben Paechter , Luis Paquete , Thomas Stützle A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. [Citation Graph (0, 0)][DBLP ] PATAT, 2002, pp:329-354 [Conf ] Leonora Bianchi , Mauro Birattari , Marco Chiarandini , Max Manfrin , Monaldo Mastrolilli , Luis Paquete , Olivia Rossi-Doria , Tommaso Schiavinotto Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. [Citation Graph (0, 0)][DBLP ] PPSN, 2004, pp:450-460 [Conf ] Michael Sampels , Christian Blum , Monaldo Mastrolilli , Olivia Rossi-Doria Metaheuristics for Group Shop Scheduling. [Citation Graph (0, 0)][DBLP ] PPSN, 2002, pp:631-640 [Conf ] Monaldo Mastrolilli A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:51-59 [Conf ] Monaldo Mastrolilli , Leonora Bianchi Core Instances for Testing: A Case Study. [Citation Graph (0, 0)][DBLP ] WEA, 2003, pp:209-221 [Conf ] Monaldo Mastrolilli Notes on Max Flow Time Minimization with Controllable Processing Times. [Citation Graph (0, 0)][DBLP ] Computing, 2003, v:71, n:4, pp:375-386 [Journal ] Klaus Jansen , Monaldo Mastrolilli Approximation schemes for parallel machine scheduling problems with controllable processing times. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2004, v:31, n:10, pp:1565-1581 [Journal ] Monaldo Mastrolilli , Marcus Hutter Hybrid Rounding Techniques for Knapsack Problems [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Monaldo Mastrolilli , Marcus Hutter Hybrid rounding techniques for knapsack problems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:4, pp:640-649 [Journal ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Approximation algorithms for flexible job shop problems. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:2, pp:361-379 [Journal ] Monaldo Mastrolilli Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:385-401 [Journal ] Monaldo Mastrolilli A linear time approximation scheme for the single machine scheduling problem with controllable processing times. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2006, v:59, n:1, pp:37-52 [Journal ] Christoph Ambühl , Monaldo Mastrolilli On-line scheduling to minimize max flow time: an optimal preemptive algorithm. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2005, v:33, n:6, pp:597-602 [Journal ] Monaldo Mastrolilli Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2003, v:6, n:6, pp:521-531 [Journal ] Monaldo Mastrolilli , Luca Maria Gambardella Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:166, n:1, pp:63-76 [Journal ] Monaldo Mastrolilli , Leonora Bianchi Core instances for testing: A case study. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:166, n:1, pp:51-62 [Journal ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Approximation schemes for job shop scheduling problems with controllable processing times. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:167, n:2, pp:297-319 [Journal ] Christian Blum , Monaldo Mastrolilli Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. [Citation Graph (0, 0)][DBLP ] Hybrid Metaheuristics, 2007, pp:123-139 [Conf ] Christoph Ambühl , Monaldo Mastrolilli , Nikolaus Mutsanas , Ola Svensson Scheduling with Precedence Constraints of Low Fractional Dimension. [Citation Graph (0, 0)][DBLP ] IPCO, 2007, pp:130-144 [Conf ] Approximating Single Machine Scheduling with Scenarios. [Citation Graph (, )][DBLP ] Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. [Citation Graph (, )][DBLP ] (Acyclic) JobShops are Hard to Approximate. [Citation Graph (, )][DBLP ] Improved Bounds for Flow Shop Scheduling. [Citation Graph (, )][DBLP ] Grouping Techniques for Scheduling Problems: Simpler and Faster. [Citation Graph (, )][DBLP ] Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. [Citation Graph (, )][DBLP ] Search in 0.031secs, Finished in 0.333secs