An application-based characterization of dynamical distance geometry problems
From MaRDI portal
Publication:2174892
Recommendations
Cites work
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers
- An approach to dynamical distance geometry
- Connected rigidity matroids and unique realizations of graphs
- Distance Geometry
- Euclidean distance geometry and applications
- Explicit sensor network localization using semidefinite representations and facial reductions
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Molecular distance geometry methods: from continuous to discrete
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On graphs and rigidity of plane skeletal structures
- Preface
- The discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Cited in
(2)
This page was built for publication: An application-based characterization of dynamical distance geometry problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174892)