{"id":1225,"date":"2020-12-01T13:27:35","date_gmt":"2020-12-01T12:27:35","guid":{"rendered":"https:\/\/minoa-itn.fau.de\/?page_id=1225"},"modified":"2022-04-28T12:06:13","modified_gmt":"2022-04-28T10:06:13","slug":"publications","status":"publish","type":"page","link":"https:\/\/minoa-itn.fau.de\/?page_id=1225","title":{"rendered":"Publications"},"content":{"rendered":"<p><strong>...as of April 28th, 2022.<\/strong><\/p>\n<p>Here we list the project results of our young researchers in the form of publications of any kind (i.e. not all articles are published\/accepted yet). We note that as a consortium we have produced more publications, but as we focus on young researchers we only list their publications.<\/p>\n<p><strong>Dissertations<\/strong><\/p>\n<ul>\n<li><strong>Davi Castro-Silva<\/strong> (2021): <a href=\"https:\/\/drive.google.com\/file\/d\/1E2GV0RIHwxApDPDWpBQXKzEbPOjst-CV\/view\">Extremal Sets with Forbidden Configurations and the Independence Ratio of Geometric Hypergraphs<\/a><\/li>\n<li><strong>Martina Cerulli<\/strong> (2021): <a href=\"https:\/\/tel.archives-ouvertes.fr\/tel-03587548\/document\">Bilevel optimization and applications<\/a><\/li>\n<li><strong>Chaitanya Gudapati<\/strong> (2022): <a href=\"http:\/\/amsdottorato.unibo.it\/10103\/\">Networks: A study in Analysis and Design<\/a><\/li>\n<li><strong> Nicol\u00f2 Gusmeroli<\/strong> (2021): <a href=\"https:\/\/digital.obvsg.at\/urn\/urn:nbn:at:at-ubk:1-41141?lang=en\">An Exact Penalty Method over Discrete Sets to Solve Binary Quadratic Problems<\/a><\/li>\n<li><strong>Shudian Zhao<\/strong> (2022): <a href=\"https:\/\/seafile.aau.at\/d\/7b2a1f2580b545c49a3b\/\">Splitting into Pieces: Alternating Direction Methods of Multipliers and Graph Partitioning<\/a><\/li>\n<\/ul>\n<p><strong>Articles in Journals<\/strong><\/p>\n<ul>\n<li><strong>Adelh\u00fctte, D.<\/strong>, A\u00dfmann, D., Grand\u00f2n, T.G. et al. Joint Model of Probabilistic-Robust (Probust) Constraints Applied to Gas Network Optimization. <i>Vietnam J. Math.<\/i> <b>49, <\/b>1097\u20131130 (2021). <a href=\"https:\/\/doi.org\/10.1007\/s10013-020-00434-y\">https:\/\/doi.org\/10.1007\/s10013-020-00434-y<\/a><\/li>\n<li><strong>Brosch, D.<\/strong>, de Klerk, E. Minimum energy configurations on a toric lattice as a quadratic assignment problem. <em>Discrete Optimization.<\/em> (2020). <a href=\"https:\/\/doi.org\/10.1016\/j.disopt.2020.100612\">https:\/\/doi.org\/10.1016\/j.disopt.2020.100612<\/a><\/li>\n<li><span class=\"authors\"><strong>Brosch D.<\/strong>, de Klerk, E.<\/span>\u00a0<span class=\"art_title\">Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software,<\/span> <span class=\"serial_title\"><em>Optimization Methods and Software<\/em>. (2022).<\/span> <span class=\"doi_link\"><a href=\"https:\/\/doi.org\/10.1080\/10556788.2021.2022146\">https:\/\/doi.org\/10.1080\/10556788.2021.2022146<\/a><\/span><\/li>\n<li><strong>Brosch, D.<\/strong>, Laurent, M., Steenkamp, A. Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling.\u00a0<em>SIAM Journal on Optimization. <\/em>(2021). <a href=\"https:\/\/doi.org\/10.1137\/20m1369592\">https:\/\/doi.org\/10.1137\/20m1369592<\/a><\/li>\n<li><strong>Castro-Silva D.<\/strong>, de Oliveira Filho FM., <strong>Slot L.<\/strong>, Vallentin F. A recursive Lov\u00e1sz theta number for simplex-avoiding sets. <em>Proceedings of<\/em> <em>the American Mathematical Society<\/em>. (2022). <a href=\"https:\/\/www.ams.org\/journals\/proc\/0000-000-00\/S0002-9939-2022-15940-1\/S0002-9939-2022-15940-1.pdf\"><em>Available here<\/em><\/a>.<\/li>\n<li><strong>Cerulli, M.<\/strong>, D\u2019Ambrosio, C., Liberti, L. et al<i>.<\/i> Detecting and solving aircraft conflicts using bilevel programming. <i>J Glob Optim<\/i> <b>81, <\/b>529\u2013557 (2021). <a href=\"https:\/\/doi.org\/10.1007\/s10898-021-00997-1\">https:\/\/doi.org\/10.1007\/s10898-021-00997-1<\/a><\/li>\n<li><strong>Cerulli, M.<\/strong>, Liberti, L. Polynomial programming prevents aircraft (and other) conflicts. <em>Operations Research Letters<\/em>. (2021). <a href=\"https:\/\/doi.org\/10.1016\/j.orl.2021.05.001\">https:\/\/doi.org\/10.1016\/j.orl.2021.05.001<\/a><\/li>\n<li><strong>Gudapati, NVC<\/strong>, Malaguti, E, Monaci, M. In search of dense subgraphs: How good is greedy peeling?. Networks.. 2021; 77: 572\u2013 586. <a href=\"https:\/\/doi.org\/10.1002\/net.22034\">https:\/\/doi.org\/10.1002\/net.22034<\/a><\/li>\n<li><strong>Gusmeroli, N.<\/strong>, Wiegele, A. EXPEDIS: An exact penalty method over discrete sets. <em>Discrete Optimization. <\/em>(2021). <a href=\"https:\/\/doi.org\/10.1016\/j.disopt.2021.100622\">https:\/\/doi.org\/10.1016\/j.disopt.2021.100622<\/a><\/li>\n<li>Leith\u00e4user, N., <strong>Adelh\u00fctte, D.<\/strong>, Braun K. et al (2022). Decision-Support Systems For Ambulatory Care, Including Pandemic Requirements: Using Mathematically Optimized Solutions. BMC Medical Informatics and Decision Making (2022). Accepted.\u00a0 <em><a href=\"https:\/\/www.researchsquare.com\/article\/rs-237619\/v1\">Available as a preprint here<\/a><\/em>.<\/li>\n<li class=\"c-bibliographic-information__citation\"><strong>Slot, L.<\/strong>, Laurent, M. Improved convergence analysis of Lasserre\u2019s measure-based upper bounds for polynomial minimization on compact sets. <i>Math. Program.<\/i> (2020). <a href=\"https:\/\/doi.org\/10.1007\/s10107-020-01468-3\">https:\/\/doi.org\/10.1007\/s10107-020-01468-3<\/a><\/li>\n<li><strong>Slot, L.<\/strong>, Laurent, M. Near-optimal analysis of Lasserre\u2019s univariate measure-based bounds for multivariate polynomial optimization. <i>Math. Program.<\/i> <b>188, <\/b>443\u2013460 (2021). <a href=\"https:\/\/doi.org\/10.1007\/s10107-020-01586-y\">https:\/\/doi.org\/10.1007\/s10107-020-01586-y<\/a><\/li>\n<li><strong>Slot, L.<\/strong>, Laurent, M. Sum-of-squares hierarchies for binary polynomial optimization. <i>Math. Program.<\/i> (2022). <a href=\"https:\/\/doi.org\/10.1007\/s10107-021-01745-9\">https:\/\/doi.org\/10.1007\/s10107-021-01745-9<\/a><\/li>\n<li>Wiegele, A., <strong>Zhao, S.<\/strong> SDP-based bounds for graph partition via extended ADMM. <i>Comput Optim Appl<\/i> <b>82, <\/b>251\u2013291 (2022). <a href=\"https:\/\/doi.org\/10.1007\/s10589-022-00355-1\">https:\/\/doi.org\/10.1007\/s10589-022-00355-1<\/a><\/li>\n<\/ul>\n<p><strong>Chapter in a Book<\/strong><\/p>\n<ul>\n<li><strong>Cerulli, M.<\/strong>, D\u2019Ambrosio, C., Liberti, L. (2019). Flying Safely by Bilevel Programming. In: Paolucci, M., Sciomachen, A., Uberti, P. (eds) Advances in Optimization and Decision Science for Society, Services and Enterprises. AIRO Springer Series, vol 3. Springer, Cham. <a href=\"https:\/\/doi.org\/10.1007\/978-3-030-34960-8_18\">https:\/\/doi.org\/10.1007\/978-3-030-34960-8_18<\/a>. <em><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02869682\/document\">Preprintversion available on archive-ouvertes<\/a>.<\/em><\/li>\n<\/ul>\n<p><strong>Conference Papers<\/strong><\/p>\n<ul>\n<li><strong>Slot, L.<\/strong>, Laurent, M. (2021). Sum-of-Squares Hierarchies for Binary Polynomial Optimization. In: Singh, M., Williamson, D.P. (eds) Integer Programming and Combinatorial Optimization. IPCO 2021. Lecture Notes in Computer Science(), vol 12707. Springer, Cham. <a href=\"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_4\">https:\/\/doi.org\/10.1007\/978-3-030-73879-2_4<\/a><\/li>\n<\/ul>\n<p><strong>Publication in Conference proceedings<\/strong><\/p>\n<ul>\n<li><strong>Cerulli, M.<\/strong>, D\u2019Ambrosio, C., Liberti, L. (2019). On aircraft deconfliction by Bilevel Programming. In: Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization.<em> <a href=\"https:\/\/www.lix.polytechnique.fr\/~liberti\/ctw19a.pdf\">Available here<\/a>.<\/em><\/li>\n<li>Gentile, C., Rinaldi G., <strong>Salgado E.<\/strong>,<strong> Tran BD.<\/strong> (2020). In: 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. <em><a href=\"https:\/\/www.researchgate.net\/publication\/344375290_A_heuristic_for_max-cut_in_toroidal_grid_graphs\">Available here<\/a>. <\/em><\/li>\n<\/ul>\n<p><strong>Technical Reports <\/strong><\/p>\n<ul>\n<li><strong>Adelh\u00fctte, D., <\/strong>Biefel, C., Kuchlbauer, M., Rolfes, J. (2021). Pareto Robust optimization on Euclidean vector spaces. Under Revision. <a href=\"https:\/\/opus4.kobv.de\/opus4-trr154\/frontdoor\/index\/index\/year\/2021\/docId\/422\"><em>Available here<\/em><\/a>.<\/li>\n<li><strong>Adelh\u00fctte, D.<\/strong>, Braun, K., Liers, F., Tschuppik, S. (2021). Minimizing Delays of Patient Transports with Incomplete Information. Under Revision. <a href=\"http:\/\/www.optimization-online.org\/DB_HTML\/2021\/02\/8242.html\"><em>Available here (last modification: December 2021).<\/em><\/a><\/li>\n<li><strong>Adelh\u00fctte, D.<\/strong>, Liers, F. (2020). \u0393-counterparts for robust nonlinear combinatorial and discrete optimization. Under Revision. <em><a href=\"http:\/\/www.optimization-online.org\/DB_HTML\/2020\/05\/7806.html\">Available here (last modification: December 2021).<\/a><\/em><\/li>\n<li><strong>Castro-Silva D.<\/strong> (2021). Geometrical sets with forbidden configurations. Under Revision. <a href=\"https:\/\/arxiv.org\/abs\/2102.10018\"><em>Available here (last modification: July 2021)<\/em>.<\/a><\/li>\n<li><strong>Castro-Silva D.<\/strong> (2021). Quasirandomness in additive groups and hypergraphs. Under Revision. <a href=\"https:\/\/arxiv.org\/abs\/2107.01463\"><em>Available here<\/em>.<\/a><\/li>\n<li>Detienne, B., <strong>Lefebvre H.<\/strong>, Malaguti E., Monaci M. (2021) .Adaptive robust optimization with objective uncertainty. Under Revision. <a href=\"https:\/\/www.researchgate.net\/publication\/354986560_Adaptive_robust_optimization_with_objective_uncertainty\"><em>Available here<\/em><\/a>.<\/li>\n<li><strong>Gudapati NVC.<\/strong>, Malaguti E., Monaci M. (2021). Network Design with Service Requirements: Scaling-up the Size of Solvable Problems. Under Revision. <a href=\"https:\/\/arxiv.org\/abs\/2107.01101\"><em>Available here<\/em><\/a>.<\/li>\n<li><strong>Gusmeroli, N.<\/strong>, Hrga T., Lu\u017ear B. et al (2020). BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints. Under Revision.<em> <a href=\"https:\/\/arxiv.org\/abs\/2009.06240\">Available here (last modification: May 2021)<\/a><\/em>.<\/li>\n<li>Laurent, M., <strong>Slot, L.<\/strong> (2021). An effective version of Schm\u00fcdgen's Positivstellensatz for the hypercube. Under Revision. <em><a href=\"https:\/\/arxiv.org\/abs\/2109.09528\">Available here<\/a>.<\/em><\/li>\n<li>Wiegele, A., <strong>Zhao, S.<\/strong> (2021). Tight SDP relaxations for cardinality-constrained problems. Under Revision. <a href=\"https:\/\/arxiv.org\/abs\/2107.11338\"><em>Available here<\/em><\/a>.<\/li>\n<li>Wolf, N., Escalona P., Angulo A.,\u00a0 <strong>Weston J.<\/strong> (2022). On Carbon Taxes Effectiveness to Induce a Clean Technology Transition: An Evaluation Framework Based on Optimal Strategic Capacity Planning. Under Revision. <em><a href=\"https:\/\/arxiv.org\/abs\/2202.11507\">Available here.<\/a><\/em><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>...as of April 28th, 2022. Here we list the project results of our young researchers in the form of publications of any kind (i.e. not all articles are published\/accepted yet). We note that as a consortium we have produced more publications, but as we focus on young researchers we only list their publications. Dissertations Davi <a href=\"https:\/\/minoa-itn.fau.de\/?page_id=1225\" class=\"more-link\">...continue reading<span class=\"screen-reader-text\"> \"Publications\"<\/span><\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-templates\/full-width.php","meta":{"footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-1225","page","type-page","status-publish","h-entry","hentry","h-as-page"],"_links":{"self":[{"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=\/wp\/v2\/pages\/1225","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1225"}],"version-history":[{"count":6,"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=\/wp\/v2\/pages\/1225\/revisions"}],"predecessor-version":[{"id":1662,"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=\/wp\/v2\/pages\/1225\/revisions\/1662"}],"wp:attachment":[{"href":"https:\/\/minoa-itn.fau.de\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1225"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}