2008 |
36 | EE | Monaldo Mastrolilli,
Nikolaus Mutsanas,
Ola Svensson:
Approximating Single Machine Scheduling with Scenarios.
APPROX-RANDOM 2008: 153-164 |
35 | EE | Monaldo Mastrolilli,
Ola Svensson:
(Acyclic) JobShops are Hard to Approximate.
FOCS 2008: 583-592 |
34 | EE | Christian Blum,
Carlos Cotta,
Antonio J. Fernández,
José E. Gallardo,
Monaldo Mastrolilli:
Hybridizations of Metaheuristics With Branch & Bound Derivates.
Hybrid Metaheuristics 2008: 85-116 |
33 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster.
Algorithmica 51(2): 183-199 (2008) |
2007 |
32 | EE | Christoph Ambühl,
Monaldo Mastrolilli,
Ola Svensson:
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.
FOCS 2007: 329-337 |
31 | EE | Christian Blum,
Monaldo Mastrolilli:
Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge.
Hybrid Metaheuristics 2007: 123-139 |
30 | EE | Christoph Ambühl,
Monaldo Mastrolilli,
Nikolaus Mutsanas,
Ola Svensson:
Scheduling with Precedence Constraints of Low Fractional Dimension.
IPCO 2007: 130-144 |
2006 |
29 | EE | Christoph Ambühl,
Monaldo Mastrolilli,
Ola Svensson:
Approximating Precedence-Constrained Single Machine Scheduling by Coloring.
APPROX-RANDOM 2006: 15-26 |
28 | EE | Christoph Ambühl,
Monaldo Mastrolilli:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
ESA 2006: 28-39 |
27 | EE | Monaldo Mastrolilli,
Marcus Hutter:
Hybrid rounding techniques for knapsack problems.
Discrete Applied Mathematics 154(4): 640-649 (2006) |
26 | EE | Monaldo Mastrolilli:
A linear time approximation scheme for the single machine scheduling problem with controllable processing times.
J. Algorithms 59(1): 37-52 (2006) |
2005 |
25 | EE | Monaldo Mastrolilli,
Leonora Bianchi:
Core instances for testing: A case study.
European Journal of Operational Research 166(1): 51-62 (2005) |
24 | EE | Monaldo Mastrolilli,
Luca Maria Gambardella:
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
European Journal of Operational Research 166(1): 63-76 (2005) |
23 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation schemes for job shop scheduling problems with controllable processing times.
European Journal of Operational Research 167(2): 297-319 (2005) |
22 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation algorithms for flexible job shop problems.
Int. J. Found. Comput. Sci. 16(2): 361-379 (2005) |
21 | EE | Christoph Ambühl,
Monaldo Mastrolilli:
On-line scheduling to minimize max flow time: an optimal preemptive algorithm.
Oper. Res. Lett. 33(6): 597-602 (2005) |
2004 |
20 | | Monaldo Mastrolilli,
Luca Maria Gambardella:
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
AAAI 2004: 173-178 |
19 | EE | 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.
PPSN 2004: 450-460 |
18 | EE | Klaus Jansen,
Monaldo Mastrolilli:
Approximation schemes for parallel machine scheduling problems with controllable processing times.
Computers & OR 31(10): 1565-1581 (2004) |
17 | EE | Monaldo Mastrolilli:
Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms.
Int. J. Found. Comput. Sci. 15(2): 385-401 (2004) |
2003 |
16 | | Klaus Jansen,
Marian Margraf,
Monaldo Mastrolilli,
José D. P. Rolim:
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings
Springer 2003 |
15 | EE | Monaldo Mastrolilli:
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms.
FCT 2003: 49-60 |
14 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Monaldo Mastrolilli:
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates.
ISAAC 2003: 319-328 |
13 | EE | Monaldo Mastrolilli,
Leonora Bianchi:
Core Instances for Testing: A Case Study.
WEA 2003: 209-221 |
12 | EE | Monaldo Mastrolilli,
Marcus Hutter:
Hybrid Rounding Techniques for Knapsack Problems
CoRR cs.CC/0305002: (2003) |
11 | EE | Monaldo Mastrolilli:
Notes on Max Flow Time Minimization with Controllable Processing Times.
Computing 71(4): 375-386 (2003) |
10 | | Monaldo Mastrolilli:
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times.
J. Scheduling 6(6): 521-531 (2003) |
2002 |
9 | EE | 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.
PATAT 2002: 329-354 |
8 | EE | Michael Sampels,
Christian Blum,
Monaldo Mastrolilli,
Olivia Rossi-Doria:
Metaheuristics for Group Shop Scheduling.
PPSN 2002: 631-640 |
7 | EE | Monaldo Mastrolilli:
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times.
SWAT 2002: 51-59 |
2001 |
6 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster.
ESA 2001: 206-217 |
5 | EE | Monaldo Mastrolilli:
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems.
FCT 2001: 525-534 |
4 | EE | Monaldo Mastrolilli:
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints.
FSTTCS 2001: 268-279 |
3 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Job Shop Scheduling Problems with Controllable Processing Times.
ICTCS 2001: 107-122 |
2000 |
2 | | Klaus Jansen,
Monaldo Mastrolilli:
Parallel Machine Scheduling Problems with Controllable Processing Times.
ICALP Satellite Workshops 2000: 179-190 |
1 | | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation Algorithms for Flexible Job Shop Problems.
LATIN 2000: 68-77 |