A linear time approximation scheme for the single machine scheduling problem with controllable processing timesMASTROLILLI, Monaldo.Journal of algorithms (Print). 2006, Vol 59, Num 1, pp 37-52, issn 0196-6774, 16 p.Article

Notes on max flow time minimization with controllable processing timesMASTROLILLI, Monaldo.Computing (Wien. Print). 2003, Vol 71, Num 4, pp 375-386, issn 0010-485X, 12 p.Article

Hardness of Approximating Flow and Job Shop Scheduling ProblemsMASTROLILLI, Monaldo; SVENSSON, Ola.Journal of the Association for Computing Machinery. 2011, Vol 58, Num 5, issn 0004-5411, 20.1-20.32Article

Combining arithmetic and geometric rounding techniques for knapsack problemsMASTROLILLI, Monaldo.Lecture notes in computer science. 2001, pp 525-534, issn 0302-9743, isbn 3-540-42487-3Conference Paper

The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover ProblemMASTROLILLI, Monaldo.Algorithmica. 2014, Vol 70, Num 2, pp 326-339, issn 0178-4617, 14 p.Conference Paper

Maximum satisfiability : How good are tabu search and plateau moves in the worst-case? : Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applicationsMASTROLILLI, Monaldo; GAMBARDELLA, Luca Maria.European journal of operational research. 2005, Vol 166, Num 1, pp 63-76, issn 0377-2217, 14 p.Conference Paper

On-line scheduling to minimize max flow time : an optimal preemptive algorithmAMBÜHL, Christoph; MASTROLILLI, Monaldo.Operations research letters. 2005, Vol 33, Num 6, pp 597-602, issn 0167-6377, 6 p.Article

Core instances for testing : A case study : Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applicationsMASTROLILLI, Monaldo; BIANCHI, Leonora.European journal of operational research. 2005, Vol 166, Num 1, pp 51-62, issn 0377-2217, 12 p.Conference Paper

Grouping Techniques for Scheduling Problems : Simpler and FasterFISHKIN, Aleksei V; JANSEN, Klaus; MASTROLILLI, Monaldo et al.Algorithmica. 2008, Vol 51, Num 2, pp 183-199, issn 0178-4617, 17 p.Article

Single Machine Precedence Constrained Scheduling Is a Vertex Cover ProblemAMBÜHL, Christoph; MASTROLILLI, Monaldo.Algorithmica. 2009, Vol 53, Num 4, pp 488-503, issn 0178-4617, 16 p.Conference Paper

Approximating precedence-constrained single machine scheduling by coloringAMBUHL, Christoph; MASTROLILLI, Monaldo; SVENSSON, Ola et al.Lecture notes in computer science. 2006, pp 15-26, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper

Single machine precedence constrained scheduling is a vertex cover problemAMBÜHL, Christoph; MASTROLILLI, Monaldo.Lecture notes in computer science. 2006, pp 28-39, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

INAPPROXIMABILITY RESULTS FOR MAXIMUM EDGE BICLIQUE, MINIMUM LINEAR ARRANGEMENT, AND SPARSEST CUTAMBÜHL, Christoph; MASTROLILLI, Monaldo; SVENSSON, Ola et al.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 567-596, issn 0097-5397, 30 p.Article

Hybrid rounding techniques for knapsack problemsMASTROLILLI, Monaldo; HUTTER, Marcus.Discrete applied mathematics. 2006, Vol 154, Num 4, pp 640-649, issn 0166-218X, 10 p.Conference Paper

Approximation schemes for job shop scheduling problems with controllable processing timesJANSEN, Klaus; MASTROLILLI, Monaldo; SOLIS-OBA, Roberto et al.European journal of operational research. 2005, Vol 167, Num 2, pp 297-319, issn 0377-2217, 23 p.Article

Scheduling to minimize max flow time: Offline and online algorithmsMASTROLILLI, Monaldo.Lecture notes in computer science. 2003, pp 49-60, issn 0302-9743, isbn 3-540-40543-7, 12 p.Conference Paper

A PTAS for the single machine scheduling problem with controllable processing timesMASTROLILLI, Monaldo.Lecture notes in computer science. 2002, pp 51-59, issn 0302-9743, isbn 3-540-43866-1, 9 p.Conference Paper

Grouping techniques for scheduling problems : Simpler and fasterFISHKIN, Aleksei V; JANSEN, Klaus; MASTROLILLI, Monaldo et al.Lecture notes in computer science. 2001, pp 206-217, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Core instances for testing: A case study: (Extended abstract)MASTROLILLI, Monaldo; BIANCHI, Leonora.Lecture notes in computer science. 2003, pp 209-221, issn 0302-9743, isbn 3-540-40205-5, 13 p.Conference Paper

Grouping techniques for one machine scheduling subject to precedence constraintsMASTROLILLI, Monaldo.Lecture notes in computer science. 2001, pp 268-279, issn 0302-9743, isbn 3-540-43002-4Conference Paper

Minimizing the sum of weighted completion times in a concurrent open shopMASTROLILLI, Monaldo; QUEYRANNE, Maurice; SCHULZ, Andreas S et al.Operations research letters. 2010, Vol 38, Num 5, pp 390-395, issn 0167-6377, 6 p.Article

On minimizing average weighted completion time: A PTAS for the job shop problem with release datesFISHKIN, Aleksei V; JANSEN, Klaus; MASTROLILLI, Monaldo et al.Lecture notes in computer science. 2003, pp 319-328, issn 0302-9743, isbn 3-540-20695-7, 10 p.Conference Paper

Job shop scheduling problems with controllable processing timesJANSEN, Klaus; MASTROLILLI, Monaldo; SOLIS-OBA, Roberto et al.Lecture notes in computer science. 2001, pp 107-122, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Metaheuristics for the vehicle routing problem with stochastic demandsBIANCHI, Leonora; BIRATTARI, Mauro; CHIARANDINI, Marco et al.Lecture notes in computer science. 2004, pp 450-460, issn 0302-9743, isbn 3-540-23092-0, 11 p.Conference Paper

A comparison of the performance of different metaheuristics on the timetabling problemROSSI-DORIAL, Olivia; SAMPELS, Michael; PAQUETE, Luis et al.Lecture notes in computer science. 2003, pp 329-351, issn 0302-9743, isbn 3-540-40699-9, 23 p.Conference Paper