Mixed-Integer Non-Linear Optimisation Applications

Risultati finali

Software for solving MINO applications

Software for solving MINO Applications M45

Final ESR report or Ph.D. thesis

Final report or PhD thesis of each ESR M48

Open-source benchmark libraries

Open-source benchmark instance libraries for the applications in WP1 (M19)

MINOA web site, flyers, roll-ups

MINOA web site, flyers, roll-ups (M4)

First report on Dissemination, Outreach and Exploitation Activities

Report on first Dissemination Activities in MINOA, for all aspects described in D5.2 (M24) Also it will include the report on the outreach activities.

Second report on Dissemination, Outreach and exploitation activities

Report on Dissemination Activities in MINOA for all aspects described in D52 M47 Also it will include the report on the outreach activities

State-of-the-art in applying WP2 methods in the WP1 areas, recommendations

Final Report on stateoftheart in applying WP2 methodologies in the WP1 areas together with recommendations about the optimisation consequences for the applications in WP1 M45

Software evaluation and recommendations

Report on software evaluation and recommendations M48

MINOA Research Challenge

Report on MINOA Research Challenge describing the topic of the challenge the submissions received the evaluation of the challenge and the results achieved M47

State-of-the-art for MINO algorithms

Final Report on stateoftheart in solving MINO algorithms M45

Pubblicazioni

A heuristic for max-cut in toroidal grid graphs

Autori: Claudio Gentile, Giovanni Rinaldi, Esteban Salgado, Bao Duy Tran
Pubblicato in: 2020
Editore: CTW 2020

On aircraft deconfliction by Bilevel Programming

Autori: Martina Cerulli, Claudia D'Ambrosio, Leo Liberti
Pubblicato in: Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2019
Editore: University of Twente

Flying Safely by Bilevel Programming

Autori: Martina Cerulli, Claudia D'Ambrosio, Leo Liberti
Pubblicato in: Advances in Optimization and Decision Science for Society, Services and Enterprises, 2019, ISBN 978-3-030-34960-8
Editore: Springer
DOI: 10.1007/978-3-030-34960-8_18

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel

Autori: Lucas Slot
Pubblicato in: 2021
Editore: Cornell University

Minimizing Delays of Patient Transports with Incomplete Information

Autori: Dennis Adelhütte, Kristin Braun, Frauke Liers, Sebastian Tschuppik
Pubblicato in: 2021
Editore: Optimization Online

Network Design with Service Requirements: Scaling-up the Size of Solvable Problems

Autori: Naga V. C. Gudapati, Enrico Malaguti, Michele Monaci
Pubblicato in: 2021
Editore: Cornell University

An effective version of Schmüdgen's Positivstellensatz for the hypercube

Autori: Monique Laurent and Lucas Slot
Pubblicato in: 2021
Editore: Cornell University

SDP-based bounds for graph partition via extended ADMM

Autori: Angelika Wiegele, Shudian Zhao
Pubblicato in: 2021
Editore: Cornell University

Quasirandomness in additive groups and hypergraphs

Autori: Davi Castro-Silva
Pubblicato in: 2021
Editore: Cornell University

A parallel branch-and-bound solver for binary quadratic problems with linear constraints

Autori: Nicolò Gusmeroli, Timotej Hrga, Borut Lužar, Janez Povh, Melanie Siebenhofer, Angelika Wiegele
Pubblicato in: 2020
Editore: Cornell University

Γ-counterparts for robust nonlinear combinatorial and discrete optimization

Autori: Dennis Adelhütte and Frauke Liers
Pubblicato in: 2020
Editore: Optimization Online

Near-optimal analysis of univariate moment bounds for polynomial optimization

Autori: Monique Laurent, Lucas Slot
Pubblicato in: 2020
Editore: Cornell University

Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions

Autori: Leithäuser Neele, Adelhütte Dennis, Braun Kristin, Büsing Christina, Comis Martin, Gersing Timo, Johann Sebastian, Koster Arie, Krumke Sven, Liers Frauke, Schmidt Eva, Schneider Johanna, Streicher Manuel, Tschuppik Sebastian, Wrede Sophia
Pubblicato in: 2021
Editore: Researchsquare
DOI: 10.21203/rs.3.rs-237619/v1

A recursive Lovász theta number for simplex-avoiding sets

Autori: Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin
Pubblicato in: 2021
Editore: Cornell University

Geometrical sets with forbidden configurations

Autori: Davi Castro-Silva
Pubblicato in: 2021
Editore: Cornell University

Adaptive robust optimization with objective uncertainty

Autori: Boris Detienne, Henri Lefebvre, Enrico Malaguti, Michele Monaci
Pubblicato in: 2021
Editore: ResearchGate GmbH
DOI: 10.13140/rg.2.2.25146.11204

Pareto robust optimization on euclidean vector spaces

Autori: Dennis Adelhuette, Christian Biefel, Martina Kuchlbauer, Jan Rolfes
Pubblicato in: 2021
Editore: Cornell University

Tight SDP relaxations for cardinality-constrained problems

Autori: Angelika Wiegele and Shudian Zhao
Pubblicato in: 2021
Editore: Cornell University

On Carbon Taxes Effectiveness to Induce a Clean Technology Transition: An Evaluation Framework Based on Optimal Strategic Capacity Planning

Autori: N. Wolf, P. Escalona, A. Angulo, J. Weston
Pubblicato in: 2022
Editore: Cornell University

Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software

Autori: Daniel Brosch, Etienne de Klerk
Pubblicato in: 2021
Editore: Cornell University

Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling

Autori: Daniel Brosch, Monique Laurent, A. Steenkamp Read More: https://epubs.siam.org/doi/10.1137/20M1369592
Pubblicato in: SIAM Journal on Optimization, 2021, ISSN 1052-6234
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1369592

Minimum energy configurations on a toric lattice as a quadratic assignment problem

Autori: Daniel Brosch and Etienne de Klerk
Pubblicato in: Discrete Optimization, 2020, ISSN 1572-5286
Editore: Elsevier BV
DOI: 10.1016/j.disopt.2020.100612

Polynomial programming prevents aircraft (and other) conflicts

Autori: Martina Cerulli and Leo Liberti
Pubblicato in: Operations Research Letters, 2021, ISSN 0167-6377
Editore: Elsevier BV
DOI: 10.1016/j.orl.2021.05.001

In Search of Dense Subgraphs: How Good is Greedy Peeling?

Autori: Naga Venkata Chaitanya Gudapati, Enrico Malaguti, Michele Monaci
Pubblicato in: Networks, 2021, ISSN 0028-3045
Editore: John Wiley & Sons Inc.
DOI: 10.1002/net.22034

Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets

Autori: Lucas Slot, Monique Laurent
Pubblicato in: Mathematical Programming, 2020, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-020-01468-3

EXPEDIS: An exact penalty method over discrete sets

Autori: Nicolò Gusmeroli and Angelika Wiegele
Pubblicato in: Discrete Optimization, 2021, ISSN 1572-5286
Editore: Elsevier BV
DOI: 10.1016/j.disopt.2021.100622

Joint model of probabilistic-robust (probust) constraints applied to gas network optimization

Autori: Dennis Adelhütte, Denis Aßmann, Tatiana Grandón, Martin Gugat, Holger Heitsch, René Henrion, Frauke Liers, Sabrina Nitsche, Ruediger Schultz, Michael Stingl, David Wintergerst
Pubblicato in: Vietnam Journal of Mathematics, 2021, ISSN 2305-2228
Editore: Springer Science + Business Media
DOI: 10.1007/s10013-020-00434-y

Detecting and solving aircraft conflicts using bilevel programming

Autori: Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrin
Pubblicato in: Journal of Global Optimization, 2021, ISSN 0925-5001
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10898-021-00997-1

Sum-of-squares hierarchies for binary polynomial optimization

Autori: Lucas Slot and Monique Laurent
Pubblicato in: Mathematical Programming, 2022, ISSN 1436-4646
Editore: Springer (Mathematical Optimization Society)
DOI: 10.1007/s10107-021-01745-9

È in corso la ricerca di dati su OpenAIRE...

Risultati finali

Pubblicazioni

Condividi questa pagina

Scarica