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 …

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 …

What do clocks, wireless devices, atoms, and submarines have in common? They move: the
clocks move time forward (so to speak), wireless devices usually move on a plane (like an …

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 …

Open Research Areas in Distance Geometry | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …

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 …

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 …

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) …

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 …

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 …