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

DOI10.1287/IJOC.2020.1039MaRDI QIDQ5084653zbMATH OpenOpenAlexFDO

Authors Moira MacNeil, Merve Bodur

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 programmingconstraint programmingdecomposition algorithmsdistance geometrydiscretization order

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Constraint programming approaches for the discretizable molecular distance geometry problem
• Exact approaches for the minimum subgraph diameter problem
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
• Integer Programming Formulations for Minimum Spanning Tree Interdiction
• Solving diameter-constrained minimum spanning tree problems by constraint programming

Cites work

• scientific article; zbMATH DE number 2243353 (Why is no real title available?)
• An introduction to distance geometry applied to molecular geometry
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Discretization orders for distance geometry problems
• Discretization vertex orders in distance geometry
• Edge-disjoint spanning trees and depth-first search
• Euclidean distance geometry and applications
• Integer Programming Formulation of Traveling Salesman Problems
• 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
• Vertex ordering with optimal number of adjacent predecessors

Cited in

(2)

• Distances between optimal solutions of mixed-integer programs
• The referenced vertex ordering problem: theory, applications, and solution methods

Describes a project that uses

Uses Software

• MIN REVORDER
• MinDouble

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084653)