Cycle-based formulations in distance geometry
From MaRDI portal
Publication:6114894
DOI10.5802/ojmo.18zbMath1520.51003arXiv2006.11523OpenAlexW3036513940MaRDI QIDQ6114894
Carlile C. Lavor, Nelson F. Maculan, Leo Liberti, Gabriele Iommazzo
Publication date: 12 July 2023
Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.11523
Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) General theory of distance geometry (51K05) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Graphs, networks and algorithms.
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- New error measures and methods for realizing protein graphs from distance data
- Angular synchronization by eigenvectors and semidefinite programming
- The discretizable molecular distance geometry problem
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- A greedy approach to compute a minimum cycle basis of a directed graph
- Embedding graphs in surfaces
- On minimal elementary bipartite graphs
- Cuts, matrix completions and graph rigidity
- Distance geometry in linearizable norms
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- The discretizable distance geometry problem
- A matroid view of key theorems for edge-swapping algorithms
- Distance geometry and data science
- Barvinok's naive algorithm in distance geometry
- Open research areas in distance geometry
- A multiplicative weights update algorithm for MINLP
- Generic global rigidity
- Random sampling of large planar maps and convex polyhedra
- Diagonally Dominant Programming in Distance Geometry
- Molecular distance geometry methods: from continuous to discrete
- Partial Metric Spaces
- Branching and bounds tighteningtechniques for non-convex MINLP
- Characterizing generic global rigidity
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Algorithms for Generating Fundamental Cycles in a Graph
- Matching, Euler tours and the Chinese postman
- Euclidean Distance Geometry
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- Computational Experience with the Molecular Distance Geometry Problem
- An algorithm for finding a fundamental set of cycles of a graph
- Algorithms - ESA 2003
