| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Monaldo Mastrolilli |
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem.  |
LATIN  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Ola Svensson |
Hardness of Approximating Flow and Job Shop Scheduling Problems. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Kuhn, Monaldo Mastrolilli |
Vertex Cover in Graphs with Locally Few Colors. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan |
Minimizing the sum of weighted completion times in a concurrent open shop. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Christian Blum |
On the use of different types of knowledge in metaheuristics based on constructing solutions. |
Eng. Appl. of AI |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli |
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Algorithms, Vertex cover |
| 1 | Monaldo Mastrolilli, Ola Svensson |
Improved Bounds for Flow Shop Scheduling. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
Grouping Techniques for Scheduling Problems: Simpler and Faster. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. |
Bulletin of the EATCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Monaldo Mastrolilli |
Hybridizations of Metaheuristics With Branch & Bound Derivates. |
Hybrid Metaheuristics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
Approximating Single Machine Scheduling with Scenarios. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Ola Svensson |
(Acyclic) JobShops are Hard to Approximate. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Montemanni, János Barta, Monaldo Mastrolilli, Luca Maria Gambardella |
The Robust Traveling Salesman Problem with Interval Data. |
Transportation Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
Scheduling with Precedence Constraints of Low Fractional Dimension. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Blum, Monaldo Mastrolilli |
Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. |
Hybrid Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luis Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto |
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. |
J. Math. Model. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
A linear time approximation scheme for the single machine scheduling problem with controllable processing times. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Marcus Hutter |
Hybrid rounding techniques for knapsack problems. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli |
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Approximating Precedence-Constrained Single Machine Scheduling by Coloring. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli |
On-line scheduling to minimize max flow time: an optimal preemptive algorithm. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |
Approximation algorithms for flexible job shop problems. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Luca Maria Gambardella |
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Leonora Bianchi |
Core instances for testing: A case study. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |
Approximation schemes for job shop scheduling problems with controllable processing times. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms. |
Int. J. Found. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli |
Approximation schemes for parallel machine scheduling problems with controllable processing times. |
Computers & OR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Luca Maria Gambardella |
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? |
AAAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
Notes on Max Flow Time Minimization with Controllable Processing Times. |
Computing |
2003 |
DBLP DOI BibTeX RDF |
Scheduling, approximation algorithms, parallel machines, controllable processing times |
| 1 | Monaldo Mastrolilli |
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. |
J. Scheduling |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Marcus Hutter |
Hybrid Rounding Techniques for Knapsack Problems |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim (eds.) |
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings |
WEA |
2003 |
DBLP BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Leonora Bianchi |
Core Instances for Testing: A Case Study. |
WEA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
scheduling, Approximation, PTAS, job shop |
| 1 | Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria |
Metaheuristics for Group Shop Scheduling. |
PPSN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
Grouping Techniques for Scheduling Problems: Simpler and Faster. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |
Job Shop Scheduling Problems with Controllable Processing Times. |
ICTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli |
Parallel Machine Scheduling Problems with Controllable Processing Times. |
ICALP Satellite Workshops |
2000 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |
Approximation Algorithms for Flexible Job Shop Problems. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")