Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Monaldo Mastrolilli"
download as .bib file
@article{DBLP:journals/toct/KurpiszLM24,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization
Problems},
journal = {{ACM} Trans. Comput. Theory},
volume = {16},
number = {1},
pages = {3:1--3:16},
year = {2024},
url = {https://doi.org/10.1145/3626106},
doi = {10.1145/3626106},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/KurpiszLM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-13773,
author = {Ambrogio Maria Bernardelli and
Eleonora Vercesi and
Stefano Gualandi and
Monaldo Mastrolilli and
Luca Maria Gambardella},
title = {On the integrality gap of the Complete Metric Steiner Tree Problem
via a novel formulation},
journal = {CoRR},
volume = {abs/2405.13773},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.13773},
doi = {10.48550/ARXIV.2405.13773},
eprinttype = {arXiv},
eprint = {2405.13773},
timestamp = {Mon, 24 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-13773.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/VercesiGMG23,
author = {Eleonora Vercesi and
Stefano Gualandi and
Monaldo Mastrolilli and
Luca Maria Gambardella},
title = {On the generation of metric {TSP} instances with a large integrality
gap by branch-and-cut},
journal = {Math. Program. Comput.},
volume = {15},
number = {2},
pages = {389--416},
year = {2023},
url = {https://doi.org/10.1007/s12532-023-00235-7},
doi = {10.1007/S12532-023-00235-7},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/VercesiGMG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BienstockFMMSZ22,
author = {Daniel Bienstock and
Yuri Faenza and
Igor Malinovic and
Monaldo Mastrolilli and
Ola Svensson and
Mark Zuckerberg},
title = {On inequalities with bounded coefficients and pitch for the min knapsack
polytope},
journal = {Discret. Optim.},
volume = {44},
number = {Part},
pages = {100567},
year = {2022},
url = {https://doi.org/10.1016/j.disopt.2020.100567},
doi = {10.1016/J.DISOPT.2020.100567},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BienstockFMMSZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BharathiM22,
author = {Arpitha P. Bharathi and
Monaldo Mastrolilli},
title = {Ideal Membership Problem over 3-Element CSPs with Dual Discriminator
Polymorphism},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {1800--1822},
year = {2022},
url = {https://doi.org/10.1137/21m1397131},
doi = {10.1137/21M1397131},
timestamp = {Tue, 07 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BharathiM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Mastrolilli21,
author = {Monaldo Mastrolilli},
title = {The Complexity of the Ideal Membership Problem for Constrained Problems
Over the Boolean Domain},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {4},
pages = {32:1--32:29},
year = {2021},
url = {https://doi.org/10.1145/3449350},
doi = {10.1145/3449350},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Mastrolilli21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BharathiM21,
author = {Arpitha P. Bharathi and
Monaldo Mastrolilli},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Ideal Membership Problem for Boolean Minority and Dual Discriminator},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {16:1--16:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.16},
doi = {10.4230/LIPICS.MFCS.2021.16},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BharathiM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KurpiszLM20,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {Sum-of-squares hierarchy lower bounds for symmetric formulations},
journal = {Math. Program.},
volume = {182},
number = {1},
pages = {369--397},
year = {2020},
url = {https://doi.org/10.1007/s10107-019-01398-9},
doi = {10.1007/S10107-019-01398-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/KurpiszLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/Mastrolilli20,
author = {Monaldo Mastrolilli},
title = {High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy,
and Chv{\'{a}}tal-Gomory Cuts},
journal = {{SIAM} J. Optim.},
volume = {30},
number = {1},
pages = {798--822},
year = {2020},
url = {https://doi.org/10.1137/17M1150712},
doi = {10.1137/17M1150712},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/Mastrolilli20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BharathiM20,
author = {Arpitha P. Bharathi and
Monaldo Mastrolilli},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Ideal Membership Problem and a Majority Polymorphism over the Ternary
Domain},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {13:1--13:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.13},
doi = {10.4230/LIPICS.MFCS.2020.13},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BharathiM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-16422,
author = {Arpitha P. Bharathi and
Monaldo Mastrolilli},
title = {Ideal Membership Problem for Boolean Minority},
journal = {CoRR},
volume = {abs/2006.16422},
year = {2020},
url = {https://arxiv.org/abs/2006.16422},
eprinttype = {arXiv},
eprint = {2006.16422},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-16422.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Mastrolilli19,
author = {Monaldo Mastrolilli},
editor = {Timothy M. Chan},
title = {The Complexity of the Ideal Membership Problem for Constrained Problems
Over the Boolean Domain},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {456--475},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.29},
doi = {10.1137/1.9781611975482.29},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/Mastrolilli19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04072,
author = {Monaldo Mastrolilli},
title = {The Complexity of the Ideal Membership Problem and Theta Bodies for
Constrained Problems Over the Boolean Domain},
journal = {CoRR},
volume = {abs/1904.04072},
year = {2019},
url = {http://arxiv.org/abs/1904.04072},
eprinttype = {arXiv},
eprint = {1904.04072},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KurpiszLM18,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {Sum-of-squares rank upper bounds for matching problems},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {831--844},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0169-2},
doi = {10.1007/S10878-017-0169-2},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KurpiszLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KurpiszMMMVW18,
author = {Adam Kurpisz and
Monaldo Mastrolilli and
Claire Mathieu and
Tobias M{\"{o}}mke and
Victor Verdugo and
Andreas Wiese},
title = {Semidefinite and linear programming integrality gaps for scheduling
identical machines},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {231--248},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1152-5},
doi = {10.1007/S10107-017-1152-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KurpiszMMMVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/FaenzaMMS18,
author = {Yuri Faenza and
Igor Malinovic and
Monaldo Mastrolilli and
Ola Svensson},
editor = {Jon Lee and
Giovanni Rinaldi and
Ali Ridha Mahjoub},
title = {On Bounded Pitch Inequalities for the Min-Knapsack Polytope},
booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10856},
pages = {170--182},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96151-4\_15},
doi = {10.1007/978-3-319-96151-4\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/FaenzaMMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-08850,
author = {Yuri Faenza and
Igor Malinovic and
Monaldo Mastrolilli and
Ola Svensson},
title = {On bounded pitch inequalities for the min-knapsack polytope},
journal = {CoRR},
volume = {abs/1801.08850},
year = {2018},
url = {http://arxiv.org/abs/1801.08850},
eprinttype = {arXiv},
eprint = {1801.08850},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-08850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KurpiszLM17,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {135--143},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0797},
doi = {10.1287/MOOR.2016.0797},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KurpiszLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KurpiszLM17,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially
solvable problem},
journal = {Math. Program.},
volume = {166},
number = {1-2},
pages = {1--17},
year = {2017},
url = {https://doi.org/10.1007/s10107-016-1102-7},
doi = {10.1007/S10107-016-1102-7},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KurpiszLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Mastrolilli17,
author = {Monaldo Mastrolilli},
editor = {Friedrich Eisenbrand and
Jochen K{\"{o}}nemann},
title = {High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy
and {CG} Cuts},
booktitle = {Integer Programming and Combinatorial Optimization - 19th International
Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10328},
pages = {405--416},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59250-3\_33},
doi = {10.1007/978-3-319-59250-3\_33},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Mastrolilli17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2016,
editor = {Klaus Jansen and
Monaldo Mastrolilli},
title = {Approximation and Online Algorithms - 14th International Workshop,
{WAOA} 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10138},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-51741-4},
doi = {10.1007/978-3-319-51741-4},
isbn = {978-3-319-51740-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-07966,
author = {Monaldo Mastrolilli},
title = {High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy
and Chv{\'{a}}tal-Gomory cuts},
journal = {CoRR},
volume = {abs/1709.07966},
year = {2017},
url = {http://arxiv.org/abs/1709.07966},
eprinttype = {arXiv},
eprint = {1709.07966},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-07966.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Mastrolilli17,
author = {Monaldo Mastrolilli},
title = {High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy
and Chvatal-Gomory cuts},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-157}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/157},
eprinttype = {ECCC},
eprint = {TR17-157},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Mastrolilli17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KurpiszLM16,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization
Problems},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {78:1--78:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.78},
doi = {10.4230/LIPICS.ICALP.2016.78},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KurpiszLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KurpiszLM16,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {362--374},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_30},
doi = {10.1007/978-3-319-33461-5\_30},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/KurpiszLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KurpiszMMMVW16,
author = {Adam Kurpisz and
Monaldo Mastrolilli and
Claire Mathieu and
Tobias M{\"{o}}mke and
Victor Verdugo and
Andreas Wiese},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Semidefinite and Linear Programming Integrality Gaps for Scheduling
Identical Machines},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {152--163},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_13},
doi = {10.1007/978-3-319-33461-5\_13},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/KurpiszMMMVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/KurpiszLM16,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
editor = {Raffaele Cerulli and
Satoru Fujishige and
Ali Ridha Mahjoub},
title = {Sum-of-Squares Rank Upper Bounds for Matching Problems},
booktitle = {Combinatorial Optimization - 4th International Symposium, {ISCO} 2016,
Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9849},
pages = {403--413},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45587-7\_35},
doi = {10.1007/978-3-319-45587-7\_35},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/KurpiszLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KurpiszLM16,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {Tight Sum-of-Squares lower bounds for binary polynomial optimization
problems},
journal = {CoRR},
volume = {abs/1605.03019},
year = {2016},
url = {http://arxiv.org/abs/1605.03019},
eprinttype = {arXiv},
eprint = {1605.03019},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KurpiszLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KurpiszLM16,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {Sum-of-squares hierarchy lower bounds for symmetric formulations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-079}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/079},
eprinttype = {ECCC},
eprint = {TR16-079},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KurpiszLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KurpiszLM15,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {853--864},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_71},
doi = {10.1007/978-3-662-48350-3\_71},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/KurpiszLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KurpiszLM15,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {872--885},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_71},
doi = {10.1007/978-3-662-47672-7\_71},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KurpiszLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KurpiszLM15,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy},
journal = {CoRR},
volume = {abs/1510.01891},
year = {2015},
url = {http://arxiv.org/abs/1510.01891},
eprinttype = {arXiv},
eprint = {1510.01891},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KurpiszLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KurpiszLM15a,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem},
journal = {CoRR},
volume = {abs/1511.08644},
year = {2015},
url = {http://arxiv.org/abs/1511.08644},
eprinttype = {arXiv},
eprint = {1511.08644},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KurpiszLM15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Mastrolilli14,
author = {Monaldo Mastrolilli},
title = {The Feedback Arc Set Problem with Triangle Inequality Is a Vertex
Cover Problem},
journal = {Algorithmica},
volume = {70},
number = {2},
pages = {326--339},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9811-2},
doi = {10.1007/S00453-013-9811-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Mastrolilli14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MastrolilliS14,
author = {Monaldo Mastrolilli and
Georgios Stamoulis},
title = {Bi-criteria and approximation algorithms for restricted matchings},
journal = {Theor. Comput. Sci.},
volume = {540},
pages = {115--132},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.11.027},
doi = {10.1016/J.TCS.2013.11.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MastrolilliS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BoriaKLM14,
author = {Nicolas Boria and
Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
editor = {Daniel G. Brown and
Burkhard Morgenstern},
title = {Improved Approximation for the Maximum Duo-Preservation String Mapping
Problem},
booktitle = {Algorithms in Bioinformatics - 14th International Workshop, {WABI}
2014, Wroclaw, Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8701},
pages = {14--25},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44753-6\_2},
doi = {10.1007/978-3-662-44753-6\_2},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wabi/BoriaKLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KurpiszLM14,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities},
journal = {CoRR},
volume = {abs/1407.1746},
year = {2014},
url = {http://arxiv.org/abs/1407.1746},
eprinttype = {arXiv},
eprint = {1407.1746},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KurpiszLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MastrolilliR13,
author = {Monaldo Mastrolilli and
Arash Rafiey},
title = {On the approximation of minimum cost homomorphism to bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {670--676},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.05.002},
doi = {10.1016/J.DAM.2011.05.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MastrolilliR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KuhnM13,
author = {Fabian Kuhn and
Monaldo Mastrolilli},
title = {Vertex cover in graphs with locally few colors},
journal = {Inf. Comput.},
volume = {222},
pages = {265--277},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2011.12.008},
doi = {10.1016/J.IC.2011.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KuhnM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MastrolilliMS13,
author = {Monaldo Mastrolilli and
Nikolaus Mutsanas and
Ola Svensson},
title = {Single machine scheduling with scenarios},
journal = {Theor. Comput. Sci.},
volume = {477},
pages = {57--66},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.006},
doi = {10.1016/J.TCS.2012.12.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MastrolilliMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganGM13,
author = {Marek Cygan and
Fabrizio Grandoni and
Monaldo Mastrolilli},
editor = {Sanjeev Khanna},
title = {How to Sell Hyperedges: The Hypermatching Assignment Problem},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {342--351},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.25},
doi = {10.1137/1.9781611973105.25},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CyganGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Mastrolilli13,
author = {Monaldo Mastrolilli},
title = {Lasserre Integrality Gaps for Certain Capacitated Covering Problems},
journal = {CoRR},
volume = {abs/1312.6493},
year = {2013},
url = {http://arxiv.org/abs/1312.6493},
eprinttype = {arXiv},
eprint = {1312.6493},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Mastrolilli13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MastrolilliS13,
author = {Monaldo Mastrolilli and
Georgios Stamoulis},
title = {Bi-Criteria and Approximation Algorithms for Restricted Matchings},
journal = {CoRR},
volume = {abs/1311.5481},
year = {2013},
url = {http://arxiv.org/abs/1311.5481},
eprinttype = {arXiv},
eprint = {1311.5481},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MastrolilliS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MastrolilliS12,
author = {Monaldo Mastrolilli and
Georgios Stamoulis},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {Restricted Max-Min Fair Allocations with Inclusion-Free Intervals},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {98--108},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_9},
doi = {10.1007/978-3-642-32241-9\_9},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/MastrolilliS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HellMNR12,
author = {Pavol Hell and
Monaldo Mastrolilli and
Mayssam Mohammadi Nevisi and
Arash Rafiey},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Approximation of Minimum Cost Homomorphisms},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {587--598},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_51},
doi = {10.1007/978-3-642-33090-2\_51},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HellMNR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/MastrolilliS12,
author = {Monaldo Mastrolilli and
Georgios Stamoulis},
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Constrained Matching Problems in Bipartite Graphs},
booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
pages = {344--355},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4\_31},
doi = {10.1007/978-3-642-32147-4\_31},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/MastrolilliS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Mastrolilli12,
author = {Monaldo Mastrolilli},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {The Feedback Arc Set Problem with Triangle Inequality Is a Vertex
Cover Problem},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {556--567},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_47},
doi = {10.1007/978-3-642-29344-3\_47},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/Mastrolilli12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KurpiszMS12,
author = {Adam Kurpisz and
Monaldo Mastrolilli and
Georgios Stamoulis},
editor = {Thomas Erlebach and
Giuseppe Persiano},
title = {Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems},
booktitle = {Approximation and Online Algorithms - 10th International Workshop,
{WAOA} 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {7846},
pages = {159--172},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-38016-7\_14},
doi = {10.1007/978-3-642-38016-7\_14},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/KurpiszMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MastrolilliS11,
author = {Monaldo Mastrolilli and
Ola Svensson},
title = {Hardness of Approximating Flow and Job Shop Scheduling Problems},
journal = {J. {ACM}},
volume = {58},
number = {5},
pages = {20:1--20:32},
year = {2011},
url = {https://doi.org/10.1145/2027216.2027218},
doi = {10.1145/2027216.2027218},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MastrolilliS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/AmbuhlMMS11,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli and
Nikolaus Mutsanas and
Ola Svensson},
title = {On the Approximability of Single-Machine Scheduling with Precedence
Constraints},
journal = {Math. Oper. Res.},
volume = {36},
number = {4},
pages = {653--669},
year = {2011},
url = {https://doi.org/10.1287/moor.1110.0512},
doi = {10.1287/MOOR.1110.0512},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/AmbuhlMMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmbuhlMS11,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli and
Ola Svensson},
title = {Inapproximability Results for Maximum Edge Biclique, Minimum Linear
Arrangement, and Sparsest Cut},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {2},
pages = {567--596},
year = {2011},
url = {https://doi.org/10.1137/080729256},
doi = {10.1137/080729256},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AmbuhlMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KuhnM11,
author = {Fabian Kuhn and
Monaldo Mastrolilli},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Vertex Cover in Graphs with Locally Few Colors},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {498--509},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_42},
doi = {10.1007/978-3-642-22006-7\_42},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KuhnM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-4299,
author = {Monaldo Mastrolilli},
title = {The Feedback Arc Set Problem with Triangle Inequality is a Vertex
Cover Problem},
journal = {CoRR},
volume = {abs/1111.4299},
year = {2011},
url = {http://arxiv.org/abs/1111.4299},
eprinttype = {arXiv},
eprint = {1111.4299},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-4299.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eaai/MastrolilliB10,
author = {Monaldo Mastrolilli and
Christian Blum},
title = {On the use of different types of knowledge in metaheuristics based
on constructing solutions},
journal = {Eng. Appl. Artif. Intell.},
volume = {23},
number = {5},
pages = {650--659},
year = {2010},
url = {https://doi.org/10.1016/j.engappai.2010.01.018},
doi = {10.1016/J.ENGAPPAI.2010.01.018},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eaai/MastrolilliB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MastrolilliQSSU10,
author = {Monaldo Mastrolilli and
Maurice Queyranne and
Andreas S. Schulz and
Ola Svensson and
Nelson A. Uhan},
title = {Minimizing the sum of weighted completion times in a concurrent open
shop},
journal = {Oper. Res. Lett.},
volume = {38},
number = {5},
pages = {390--395},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2010.04.011},
doi = {10.1016/J.ORL.2010.04.011},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/MastrolilliQSSU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmbuhlM09,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli},
title = {Single Machine Precedence Constrained Scheduling Is a Vertex Cover
Problem},
journal = {Algorithmica},
volume = {53},
number = {4},
pages = {488--503},
year = {2009},
url = {https://doi.org/10.1007/s00453-008-9251-6},
doi = {10.1007/S00453-008-9251-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AmbuhlM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MastrolilliS09,
author = {Monaldo Mastrolilli and
Ola Svensson},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {Improved Bounds for Flow Shop Scheduling},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {677--688},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_56},
doi = {10.1007/978-3-642-02927-1\_56},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MastrolilliS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FishkinJM08,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Monaldo Mastrolilli},
title = {Grouping Techniques for Scheduling Problems: Simpler and Faster},
journal = {Algorithmica},
volume = {51},
number = {2},
pages = {183--199},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9086-6},
doi = {10.1007/S00453-007-9086-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FishkinJM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/AmbuhlMMS08,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli and
Nikolaus Mutsanas and
Ola Svensson},
title = {Precedence Constraint Scheduling and Connections to Dimension Theory
of Partial Orders},
journal = {Bull. {EATCS}},
volume = {95},
pages = {37--58},
year = {2008},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/AmbuhlMMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MastrolilliMS08,
author = {Monaldo Mastrolilli and
Nikolaus Mutsanas and
Ola Svensson},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Approximating Single Machine Scheduling with Scenarios},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {153--164},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_13},
doi = {10.1007/978-3-540-85363-3\_13},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MastrolilliMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MastrolilliS08,
author = {Monaldo Mastrolilli and
Ola Svensson},
title = {(Acyclic) JobShops are Hard to Approximate},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {583--592},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.36},
doi = {10.1109/FOCS.2008.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MastrolilliS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/sci/BlumCFGM08,
author = {Christian Blum and
Carlos Cotta and
Antonio J. Fern{\'{a}}ndez and
Jos{\'{e}} E. Gallardo and
Monaldo Mastrolilli},
editor = {Christian Blum and
Mar{\'{\i}}a J. Blesa Aguilera and
Andrea Roli and
Michael Sampels},
title = {Hybridizations of Metaheuristics With Branch {\&} Bound Derivates},
booktitle = {Hybrid Metaheuristics, An Emerging Approach to Optimization},
series = {Studies in Computational Intelligence},
volume = {114},
pages = {85--116},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78295-7\_4},
doi = {10.1007/978-3-540-78295-7\_4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/series/sci/BlumCFGM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/MontemanniBMG07,
author = {Roberto Montemanni and
J{\'{a}}nos Barta and
Monaldo Mastrolilli and
Luca Maria Gambardella},
title = {The Robust Traveling Salesman Problem with Interval Data},
journal = {Transp. Sci.},
volume = {41},
number = {3},
pages = {366--381},
year = {2007},
url = {https://doi.org/10.1287/trsc.1060.0181},
doi = {10.1287/TRSC.1060.0181},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/MontemanniBMG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AmbuhlMS07,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli and
Ola Svensson},
title = {Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement,
and Precedence Constrained Scheduling},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {329--337},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.40},
doi = {10.1109/FOCS.2007.40},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AmbuhlMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hm/BlumM07,
author = {Christian Blum and
Monaldo Mastrolilli},
editor = {Thomas Bartz{-}Beielstein and
Mar{\'{\i}}a J. Blesa Aguilera and
Christian Blum and
Boris Naujoks and
Andrea Roli and
G{\"{u}}nter Rudolph and
Michael Sampels},
title = {Using Branch {\&} Bound Concepts in Construction-Based Metaheuristics:
Exploiting the Dual Problem Knowledge},
booktitle = {Hybrid Metaheuristics, 4th International Workshop, {HM} 2007, Dortmund,
Germany, October 8-9, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4771},
pages = {123--139},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75514-2\_10},
doi = {10.1007/978-3-540-75514-2\_10},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/hm/BlumM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AmbuhlMMS07,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli and
Nikolaus Mutsanas and
Ola Svensson},
editor = {Matteo Fischetti and
David P. Williamson},
title = {Scheduling with Precedence Constraints of Low Fractional Dimension},
booktitle = {Integer Programming and Combinatorial Optimization, 12th International
{IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4513},
pages = {130--144},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72792-7\_11},
doi = {10.1007/978-3-540-72792-7\_11},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AmbuhlMMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MastrolilliH06,
author = {Monaldo Mastrolilli and
Marcus Hutter},
title = {Hybrid rounding techniques for knapsack problems},
journal = {Discret. Appl. Math.},
volume = {154},
number = {4},
pages = {640--649},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.08.004},
doi = {10.1016/J.DAM.2005.08.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MastrolilliH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Mastrolilli06,
author = {Monaldo Mastrolilli},
title = {A linear time approximation scheme for the single machine scheduling
problem with controllable processing times},
journal = {J. Algorithms},
volume = {59},
number = {1},
pages = {37--52},
year = {2006},
url = {https://doi.org/10.1016/j.jalgor.2005.01.004},
doi = {10.1016/J.JALGOR.2005.01.004},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Mastrolilli06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmma/BianchiBCMMPRS06,
author = {Leonora Bianchi and
Mauro Birattari and
Marco Chiarandini and
Max Manfrin and
Monaldo Mastrolilli and
Lu{\'{\i}}s Paquete and
Olivia Rossi{-}Doria and
Tommaso Schiavinotto},
title = {Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic
Demands},
journal = {J. Math. Model. Algorithms},
volume = {5},
number = {1},
pages = {91--110},
year = {2006},
url = {https://doi.org/10.1007/s10852-005-9033-y},
doi = {10.1007/S10852-005-9033-Y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jmma/BianchiBCMMPRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AmbuhlMS06,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli and
Ola Svensson},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Approximating Precedence-Constrained Single Machine Scheduling by
Coloring},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {15--26},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_4},
doi = {10.1007/11830924\_4},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AmbuhlMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AmbuhlM06,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Single Machine Precedence Constrained Scheduling Is a Vertex Cover
Problem},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {28--39},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_6},
doi = {10.1007/11841036\_6},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AmbuhlM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/JansenMS05,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
title = {Approximation schemes for job shop scheduling problems with controllable
processing times},
journal = {Eur. J. Oper. Res.},
volume = {167},
number = {2},
pages = {297--319},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2004.03.025},
doi = {10.1016/J.EJOR.2004.03.025},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/JansenMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MastrolilliB05,
author = {Monaldo Mastrolilli and
Leonora Bianchi},
title = {Core instances for testing: {A} case study},
journal = {Eur. J. Oper. Res.},
volume = {166},
number = {1},
pages = {51--62},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2003.10.057},
doi = {10.1016/J.EJOR.2003.10.057},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MastrolilliB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MastrolilliG05,
author = {Monaldo Mastrolilli and
Luca Maria Gambardella},
title = {Maximum satisfiability: How good are tabu search and plateau moves
in the worst-case?},
journal = {Eur. J. Oper. Res.},
volume = {166},
number = {1},
pages = {63--76},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2003.01.005},
doi = {10.1016/J.EJOR.2003.01.005},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MastrolilliG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/JansenMS05,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
title = {Approximation algorithms for flexible job shop problems},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {2},
pages = {361--379},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003030},
doi = {10.1142/S0129054105003030},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/JansenMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AmbuhlM05,
author = {Christoph Amb{\"{u}}hl and
Monaldo Mastrolilli},
title = {On-line scheduling to minimize max flow time: an optimal preemptive
algorithm},
journal = {Oper. Res. Lett.},
volume = {33},
number = {6},
pages = {597--602},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.10.006},
doi = {10.1016/J.ORL.2004.10.006},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/AmbuhlM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/JansenM04,
author = {Klaus Jansen and
Monaldo Mastrolilli},
title = {Approximation schemes for parallel machine scheduling problems with
controllable processing times},
journal = {Comput. Oper. Res.},
volume = {31},
number = {10},
pages = {1565--1581},
year = {2004},
url = {https://doi.org/10.1016/S0305-0548(03)00101-1},
doi = {10.1016/S0305-0548(03)00101-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/JansenM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Mastrolilli04,
author = {Monaldo Mastrolilli},
title = {Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms},
journal = {Int. J. Found. Comput. Sci.},
volume = {15},
number = {2},
pages = {385--401},
year = {2004},
url = {https://doi.org/10.1142/S0129054104002480},
doi = {10.1142/S0129054104002480},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/Mastrolilli04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/MastrolilliG04,
author = {Monaldo Mastrolilli and
Luca Maria Gambardella},
editor = {Deborah L. McGuinness and
George Ferguson},
title = {{MAX-2-SAT:} How Good Is Tabu Search in the Worst-Case?},
booktitle = {Proceedings of the Nineteenth National Conference on Artificial Intelligence,
Sixteenth Conference on Innovative Applications of Artificial Intelligence,
July 25-29, 2004, San Jose, California, {USA}},
pages = {173--178},
publisher = {{AAAI} Press / The {MIT} Press},
year = {2004},
url = {http://www.aaai.org/Library/AAAI/2004/aaai04-028.php},
timestamp = {Tue, 05 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/MastrolilliG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/BianchiBCMMPRS04,
author = {Leonora Bianchi and
Mauro Birattari and
Marco Chiarandini and
Max Manfrin and
Monaldo Mastrolilli and
Lu{\'{\i}}s Paquete and
Olivia Rossi{-}Doria and
Tommaso Schiavinotto},
editor = {Xin Yao and
Edmund K. Burke and
Jos{\'{e}} Antonio Lozano and
Jim Smith and
Juan Juli{\'{a}}n Merelo Guerv{\'{o}}s and
John A. Bullinaria and
Jonathan E. Rowe and
Peter Ti{\~{n}}o and
Ata Kab{\'{a}}n and
Hans{-}Paul Schwefel},
title = {Applications Metaheuristics for the Vehicle Routing Problem with Stochastic
Demands},
booktitle = {Parallel Problem Solving from Nature - {PPSN} VIII, 8th International
Conference, Birmingham, UK, September 18-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3242},
pages = {450--460},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30217-9\_46},
doi = {10.1007/978-3-540-30217-9\_46},
timestamp = {Wed, 28 Jun 2023 16:19:43 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/BianchiBCMMPRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Mastrolilli03,
author = {Monaldo Mastrolilli},
title = {Notes on Max Flow Time Minimization with Controllable Processing Times},
journal = {Computing},
volume = {71},
number = {4},
pages = {375--386},
year = {2003},
url = {https://doi.org/10.1007/s00607-003-0029-z},
doi = {10.1007/S00607-003-0029-Z},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/computing/Mastrolilli03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Mastrolilli03,
author = {Monaldo Mastrolilli},
title = {Efficient Approximation Schemes for Scheduling Problems with Release
Dates and Delivery Times},
journal = {J. Sched.},
volume = {6},
number = {6},
pages = {521--531},
year = {2003},
url = {https://doi.org/10.1023/A:1026272526225},
doi = {10.1023/A:1026272526225},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/Mastrolilli03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Mastrolilli03,
author = {Monaldo Mastrolilli},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {Scheduling to Minimize Max Flow Time: Offline and Online Algorithms},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
{FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2751},
pages = {49--60},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_6},
doi = {10.1007/978-3-540-45077-1\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Mastrolilli03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FishkinJM03,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Monaldo Mastrolilli},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {On Minimizing Average Weighted Completion Time: {A} {PTAS} for the
Job Shop Problem with Release Dates},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {319--328},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_34},
doi = {10.1007/978-3-540-24587-2\_34},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FishkinJM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/MastrolilliB03,
author = {Monaldo Mastrolilli and
Leonora Bianchi},
editor = {Klaus Jansen and
Marian Margraf and
Monaldo Mastrolilli and
Jos{\'{e}} D. P. Rolim},
title = {Core Instances for Testing: {A} Case Study},
booktitle = {Experimental and Efficient Algorithms, Second International Workshop,
{WEA} 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2647},
pages = {209--221},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44867-5\_17},
doi = {10.1007/3-540-44867-5\_17},
timestamp = {Sun, 25 Oct 2020 22:45:48 +0100},
biburl = {https://dblp.org/rec/conf/wea/MastrolilliB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wea/2003,
editor = {Klaus Jansen and
Marian Margraf and
Monaldo Mastrolilli and
Jos{\'{e}} D. P. Rolim},
title = {Experimental and Efficient Algorithms, Second International Workshop,
{WEA} 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2647},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44867-5},
doi = {10.1007/3-540-44867-5},
isbn = {3-540-40205-5},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0305002,
author = {Monaldo Mastrolilli and
Marcus Hutter},
title = {Hybrid Rounding Techniques for Knapsack Problems},
journal = {CoRR},
volume = {cs.CC/0305002},
year = {2003},
url = {http://arxiv.org/abs/cs/0305002},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0305002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Mastrolilli2002,
author = {Monaldo Mastrolilli},
title = {Approximation schemes for scheduling problems},
school = {University of Kiel},
year = {2002},
url = {https://d-nb.info/966415671},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Mastrolilli2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/patat/Rossi-DoriaSBCDGKMMPPS02,
author = {Olivia Rossi{-}Doria and
Michael Sampels and
Mauro Birattari and
Marco Chiarandini and
Marco Dorigo and
Luca Maria Gambardella and
Joshua D. Knowles and
Max Manfrin and
Monaldo Mastrolilli and
Ben Paechter and
Lu{\'{\i}}s Paquete and
Thomas St{\"{u}}tzle},
editor = {Edmund K. Burke and
Patrick De Causmaecker},
title = {A Comparison of the Performance of Different Metaheuristics on the
Timetabling Problem},
booktitle = {Practice and Theory of Automated Timetabling IV, 4th International
Conference, {PATAT} 2002, Gent, Belgium, August 21-23, 2002, Selected
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2740},
pages = {329--354},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/978-3-540-45157-0\_22},
doi = {10.1007/978-3-540-45157-0\_22},
timestamp = {Sun, 25 Oct 2020 22:46:14 +0100},
biburl = {https://dblp.org/rec/conf/patat/Rossi-DoriaSBCDGKMMPPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/SampelsBMR02,
author = {Michael Sampels and
Christian Blum and
Monaldo Mastrolilli and
Olivia Rossi{-}Doria},
editor = {Juan Juli{\'{a}}n Merelo Guerv{\'{o}}s and
Panagiotis Adamidis and
Hans{-}Georg Beyer and
Jos{\'{e}} Luis Fern{\'{a}}ndez{-}Villaca{\~{n}}as Mart{\'{\i}}n and
Hans{-}Paul Schwefel},
title = {Metaheuristics for Group Shop Scheduling},
booktitle = {Parallel Problem Solving from Nature - {PPSN} VII, 7th International
Conference, Granada, Spain, September 7-11, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2439},
pages = {631--640},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45712-7\_61},
doi = {10.1007/3-540-45712-7\_61},
timestamp = {Sun, 25 Jul 2021 11:46:24 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/SampelsBMR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Mastrolilli02,
author = {Monaldo Mastrolilli},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {A {PTAS} for the Single Machine Scheduling Problem with Controllable
Processing Times},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {51--59},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_6},
doi = {10.1007/3-540-45471-3\_6},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Mastrolilli02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jim/GambardellaMRZ01,
author = {Luca Maria Gambardella and
Monaldo Mastrolilli and
Andrea Emilio Rizzoli and
Marco Zaffalon},
title = {An optimization methodology for intermodal terminal management},
journal = {J. Intell. Manuf.},
volume = {12},
number = {5-6},
pages = {521--534},
year = {2001},
url = {https://doi.org/10.1023/A\%3A1012208605758},
doi = {10.1023/A\%3A1012208605758},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jim/GambardellaMRZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FishkinJM01,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Monaldo Mastrolilli},
editor = {Friedhelm Meyer auf der Heide},
title = {Grouping Techniques for Scheduling Problems: Simpler and Faster},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {206--217},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_17},
doi = {10.1007/3-540-44676-1\_17},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/FishkinJM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Mastrolilli01,
author = {Monaldo Mastrolilli},
editor = {Rusins Freivalds},
title = {Combining Arithmetic and Geometric Rounding Techniques for Knapsack
Problems},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {525--534},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_59},
doi = {10.1007/3-540-44669-9\_59},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Mastrolilli01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Mastrolilli01,
author = {Monaldo Mastrolilli},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {Grouping Techniques for One Machine Scheduling Subject to Precedence
Constraints},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {268--279},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_23},
doi = {10.1007/3-540-45294-X\_23},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Mastrolilli01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/JansenMS01,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
editor = {Antonio Restivo and
Simona Ronchi Della Rocca and
Luca Roversi},
title = {Job Shop Scheduling Problems with Controllable Processing Times},
booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001,
Torino, Italy, October 4-6, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2202},
pages = {107--122},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45446-2\_7},
doi = {10.1007/3-540-45446-2\_7},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/JansenMS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenM00,
author = {Klaus Jansen and
Monaldo Mastrolilli},
editor = {Jos{\'{e}} D. P. Rolim and
Andrei Z. Broder and
Andrea Corradini and
Roberto Gorrieri and
Reiko Heckel and
Juraj Hromkovic and
Ugo Vaccaro and
J. B. Wells},
title = {Parallel Machine Scheduling Problems with Controllable Processing
Times},
booktitle = {{ICALP} Workshops 2000, Proceedings of the Satelite Workshops of the
27th International Colloquium on Automata, Languages and Programming,
Geneva, Switzerland, July 9-15, 2000},
pages = {179--190},
publisher = {Carleton Scientific, Waterloo, Ontario, Canada},
year = {2000},
timestamp = {Sat, 04 Apr 2020 17:15:23 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JansenM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/JansenMS00,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
editor = {Gaston H. Gonnet and
Daniel Panario and
Alfredo Viola},
title = {Approximation Algorithms for Flexible Job Shop Problems},
booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1776},
pages = {68--77},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10719839\_7},
doi = {10.1007/10719839\_7},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/JansenMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-07-12 19:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
