Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems

DOI10.1287/ijoc.2020.1039OpenAlexW3136013197MaRDI QIDQ5084653

Merve Bodur, Moira MacNeil

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.12468

zbMATH Keywords

integer programmingdecomposition algorithmsdistance geometryconstraint programmingdiscretization order

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

The referenced vertex ordering problem: theory, applications, and solution methods

Uses Software

• MinDouble
• MIN REVORDER

Cites Work

• Unnamed Item
• Discretization vertex orders in distance geometry
• Discretization orders for distance geometry problems
• Edge-disjoint spanning trees and depth-first search
• Recent advances on the interval distance geometry problem
• The discretizable distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Integer Programming Formulation of Traveling Salesman Problems
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• An Introduction to Distance Geometry applied to Molecular Geometry
• Vertex ordering with optimal number of adjacent predecessors
• Euclidean Distance Geometry and Applications

This page was built for publication: Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems