Mixed-Integer Non-Linear Optimisation Applications

Rezultaty

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

Publikacje

A heuristic for max-cut in toroidal grid graphs

Autorzy: Claudio Gentile, Giovanni Rinaldi, Esteban Salgado, Bao Duy Tran
Opublikowane w: 2020
Wydawca: CTW 2020

On aircraft deconfliction by Bilevel Programming

Autorzy: Martina Cerulli, Claudia D'Ambrosio, Leo Liberti
Opublikowane w: Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2019
Wydawca: University of Twente

Flying Safely by Bilevel Programming

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

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

Autorzy: Lucas Slot
Opublikowane w: 2021
Wydawca: Cornell University

Minimizing Delays of Patient Transports with Incomplete Information

Autorzy: Dennis Adelhütte, Kristin Braun, Frauke Liers, Sebastian Tschuppik
Opublikowane w: 2021
Wydawca: Optimization Online

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

Autorzy: Naga V. C. Gudapati, Enrico Malaguti, Michele Monaci
Opublikowane w: 2021
Wydawca: Cornell University

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

Autorzy: Monique Laurent and Lucas Slot
Opublikowane w: 2021
Wydawca: Cornell University

SDP-based bounds for graph partition via extended ADMM

Autorzy: Angelika Wiegele, Shudian Zhao
Opublikowane w: 2021
Wydawca: Cornell University

Quasirandomness in additive groups and hypergraphs

Autorzy: Davi Castro-Silva
Opublikowane w: 2021
Wydawca: Cornell University

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

Autorzy: Nicolò Gusmeroli, Timotej Hrga, Borut Lužar, Janez Povh, Melanie Siebenhofer, Angelika Wiegele
Opublikowane w: 2020
Wydawca: Cornell University

Γ-counterparts for robust nonlinear combinatorial and discrete optimization

Autorzy: Dennis Adelhütte and Frauke Liers
Opublikowane w: 2020
Wydawca: Optimization Online

Near-optimal analysis of univariate moment bounds for polynomial optimization

Autorzy: Monique Laurent, Lucas Slot
Opublikowane w: 2020
Wydawca: Cornell University

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

Autorzy: 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
Opublikowane w: 2021
Wydawca: Researchsquare
DOI: 10.21203/rs.3.rs-237619/v1

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

Autorzy: Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin
Opublikowane w: 2021
Wydawca: Cornell University

Geometrical sets with forbidden configurations

Autorzy: Davi Castro-Silva
Opublikowane w: 2021
Wydawca: Cornell University

Adaptive robust optimization with objective uncertainty

Autorzy: Boris Detienne, Henri Lefebvre, Enrico Malaguti, Michele Monaci
Opublikowane w: 2021
Wydawca: ResearchGate GmbH
DOI: 10.13140/rg.2.2.25146.11204

Pareto robust optimization on euclidean vector spaces

Autorzy: Dennis Adelhuette, Christian Biefel, Martina Kuchlbauer, Jan Rolfes
Opublikowane w: 2021
Wydawca: Cornell University

Tight SDP relaxations for cardinality-constrained problems

Autorzy: Angelika Wiegele and Shudian Zhao
Opublikowane w: 2021
Wydawca: Cornell University

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

Autorzy: N. Wolf, P. Escalona, A. Angulo, J. Weston
Opublikowane w: 2022
Wydawca: Cornell University

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

Autorzy: Daniel Brosch, Etienne de Klerk
Opublikowane w: 2021
Wydawca: Cornell University

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

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

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

Autorzy: Daniel Brosch and Etienne de Klerk
Opublikowane w: Discrete Optimization, 2020, ISSN 1572-5286
Wydawca: Elsevier BV
DOI: 10.1016/j.disopt.2020.100612

Polynomial programming prevents aircraft (and other) conflicts

Autorzy: Martina Cerulli and Leo Liberti
Opublikowane w: Operations Research Letters, 2021, ISSN 0167-6377
Wydawca: Elsevier BV
DOI: 10.1016/j.orl.2021.05.001

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

Autorzy: Naga Venkata Chaitanya Gudapati, Enrico Malaguti, Michele Monaci
Opublikowane w: Networks, 2021, ISSN 0028-3045
Wydawca: 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

Autorzy: Lucas Slot, Monique Laurent
Opublikowane w: Mathematical Programming, 2020, ISSN 0025-5610
Wydawca: Springer Verlag
DOI: 10.1007/s10107-020-01468-3

EXPEDIS: An exact penalty method over discrete sets

Autorzy: Nicolò Gusmeroli and Angelika Wiegele
Opublikowane w: Discrete Optimization, 2021, ISSN 1572-5286
Wydawca: Elsevier BV
DOI: 10.1016/j.disopt.2021.100622

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

Autorzy: 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
Opublikowane w: Vietnam Journal of Mathematics, 2021, ISSN 2305-2228
Wydawca: Springer Science + Business Media
DOI: 10.1007/s10013-020-00434-y

Detecting and solving aircraft conflicts using bilevel programming

Autorzy: Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrin
Opublikowane w: Journal of Global Optimization, 2021, ISSN 0925-5001
Wydawca: Kluwer Academic Publishers
DOI: 10.1007/s10898-021-00997-1

Sum-of-squares hierarchies for binary polynomial optimization

Autorzy: Lucas Slot and Monique Laurent
Opublikowane w: Mathematical Programming, 2022, ISSN 1436-4646
Wydawca: Springer (Mathematical Optimization Society)
DOI: 10.1007/s10107-021-01745-9

Wyszukiwanie danych OpenAIRE...

Rezultaty

Publikacje

Udostępnij tę stronę

Pobierz