An application-based characterization of dynamical distance geometry problems

DOI10.1007/s11590-018-1302-6zbMath1442.90168OpenAlexW2884921505WikidataQ129488370 ScholiaQ129488370MaRDI QIDQ2174892

Jérémy Omer, Paolo Giordano, Ludovic Hoyet, Franck Multon, Antonio Mucherino

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01846265/file/dynDGP-applications%20%281%29.pdf

zbMATH Keywords

distance geometrymulti-agent formationdynamical problemsmotion retargetingcrowd simulations

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers
• The discretizable molecular distance geometry problem
• An approach to dynamical distance geometry
• Connected rigidity matroids and unique realizations of graphs
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• On graphs and rigidity of plane skeletal structures
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Distance Geometry
• Molecular distance geometry methods: from continuous to discrete
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Euclidean Distance Geometry and Applications
• Preface