Maximum feasible subsystems of distance geometry constraints
From MaRDI portal
Publication:2131137
Recommendations
- New error measures and methods for realizing protein graphs from distance data
- Distance geometry optimization for protein structures
- Positive semidefinite relaxations for distance geometry problems.
- Feasibility check for the distance geometry problem: an application to molecular conformations
- Unassigned distance geometry and molecular conformation problems
Cites work
- A cycle-based formulation for the distance geometry problem
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Barvinok's naive algorithm in distance geometry
- Computational Experience with the Molecular Distance Geometry Problem
- Cones of diagonally dominant matrices
- Diagonally dominant programming in distance geometry
- Distance geometry and data science
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Euclidean distance geometry and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- scientific article; zbMATH DE number 469369 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Mathematical programming: Turing completeness and applications to software analysis
- Measure concentration in optimization
- New error measures and methods for realizing protein graphs from distance data
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Recent advances on the interval distance geometry problem
- Reconstructing a three-dimensional model with arbitrary errors
- Sum of squares basis pursuit with linear and second order cone programming
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Trees and hills: methodology for maximizing functions of systems of linear relations
- Undecidability and hardness in mixed-integer nonlinear programming
Cited in
(4)
This page was built for publication: Maximum feasible subsystems of distance geometry constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2131137)
