Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
From MaRDI portal
Publication:5084653
DOI10.1287/IJOC.2020.1039OpenAlexW3136013197MaRDI QIDQ5084653FDOQ5084653
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
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
integer programmingconstraint programmingdecomposition algorithmsdistance geometrydiscretization order
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Euclidean distance geometry and applications
- Edge-disjoint spanning trees and depth-first search
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- The discretizable distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Discretization vertex orders in distance geometry
- Discretization orders for distance geometry problems
- Recent advances on the interval distance geometry problem
- Title not available (Why is that?)
- An introduction to distance geometry applied to molecular geometry
- Vertex ordering with optimal number of adjacent predecessors
Cited In (2)
Uses Software
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)
