An integer programming approach for the search of discretization orders in distance geometry problems
From MaRDI portal
Publication:2174886
DOI10.1007/s11590-017-1207-9zbMath1442.90131MaRDI QIDQ2174886
Jérémy Omer, Douglas S. Gonçalves
Publication date: 27 April 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1207-9
Related Items
Uses Software
Cites Work
- Discretization vertex orders in distance geometry
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Edge-disjoint spanning trees and depth-first search
- Optimal partial discretization orders for discretizable distance geometry
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Facets of the linear ordering polytope
- Euclidean Distance Geometry and Applications
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems