Undecidability and hardness in mixed-integer nonlinear programming
L Liberti - RAIRO-Operations Research, 2019 - rairo-ro.org
We survey two aspects of mixed-integer nonlinear programming which have attracted less
attention (so far) than solution methods, solvers and applications: namely, whether the class …
attention (so far) than solution methods, solvers and applications: namely, whether the class …
[图书][B] Distance geometry: theory, methods, and applications
This volume is a collection of research surveys on the Distance Geometry Problem (DGP)
and its applications. It will be divided into three parts: Theory, Methods and Applications …
and its applications. It will be divided into three parts: Theory, Methods and Applications …
Distance geometry and data science
L Liberti - Top, 2020 - Springer
Data are often represented as graphs. Many common tasks in data science are based on
distances between entities. While some data science methodologies natively take graphs as …
distances between entities. While some data science methodologies natively take graphs as …
Open research areas in distance geometry
Open Research Areas in Distance Geometry | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …
New error measures and methods for realizing protein graphs from distance data
The interval distance geometry problem consists in finding a realization in R^ K RK of a
simple undirected graph G=(V, E) G=(V, E) with non-negative intervals assigned to the …
simple undirected graph G=(V, E) G=(V, E) with non-negative intervals assigned to the …
Distance geometry in linearizable norms
C D'ambrosio, L Liberti - … Conference on Geometric Science of Information, 2017 - Springer
Distance Geometry puts the concept of distance at its center. The basic problem in distance
geometry could be described as drawing an edge-weighted undirected graph in R^ K for …
geometry could be described as drawing an edge-weighted undirected graph in R^ K for …
A multiplicative weights update algorithm for MINLP
L Mencarelli, Y Sahraoui, L Liberti - EURO Journal on Computational …, 2017 - Elsevier
We discuss an application of the well-known multiplicative weights update (MWU) algorithm
to non-convex and mixed-integer non-linear programming. We present applications to:(a) …
to non-convex and mixed-integer non-linear programming. We present applications to:(a) …
A cycle-based formulation for the Distance Geometry Problem
The distance geometry problem consists in finding a realization of a weighted graph in a
Euclidean space of given dimension, where the edges are realized as straight segments of …
Euclidean space of given dimension, where the edges are realized as straight segments of …
Algorithmic configuration by learning and optimization
G Iommazzo, C d'Ambrosio, A Frangioni… - … -Twente Workshop on …, 2019 - hal.science
We propose a methodology, based on machine learning and optimization, for selecting a
solver configuration for a given instance. First, we employ a set of solved instances and …
solver configuration for a given instance. First, we employ a set of solved instances and …