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

References

• Cassioli A, Günlük O, Lavor C, Liberti L (2015) Discretization vertex orders in distance geometry. Discrete Appl. Math. 197:27–41.Crossref, Google Scholar
• Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
• Coudert D (2016) A note on integer linear programming formulations for linear ordering problems on graphs. Research report, Inria, I3S, Université Nice Sophia Antipolis, Nice, France. Google Scholar
• Gonçalves DS, Mucherino A, Lavor C, Liberti L (2017) Recent advances on the interval distance geometry problem. J. Global Optim. 69(3):525–545.Google Scholar
• Hnich B, Smith BM, Walsh T (2004) Dual modelling of permutation and injection problems. J. Artificial Intelligence Res. 21(1):357–391.Crossref, Google Scholar
• Lavor C, Liberti L, Mucherino A (2013) The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances. J. Global Optim. 56(3):855–871.Google Scholar
• Lavor C, Liberti L, Lodwick WA, da Costa TM (2017) An Introduction to Distance Geometry Applied to Molecular Geometry (Springer, Berlin).Crossref, Google Scholar
• Lavor C, Lee J, Lee-St John A, Liberti L, Mucherino A, Sviridenko M (2012) Discretization orders for distance geometry problems. Optim. Lett. 6(4):783–796.Google Scholar
• Liberti L, Lavor C, Maculan N, Mucherino A (2014) Euclidean distance geometry and applications. SIAM Rev. 56(1):3–69.Crossref, Google Scholar
• Migot T, Omer J (2020) Vertex order with optimal number of adjacent predecessors. Discrete Math. Theoretical Comput. Sci. 22(1):1–19.Google Scholar
• Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. ACM 7(4):326–329.Google Scholar
• Mucherino A (2018) On the Discretization of Distance Geometry: Theory, Algorithms and Applications. Accessed February 4, 2021, https://hal.inria.fr/tel-01846262/document.Google Scholar
• Mucherino A, Lavor C, Liberti L (2012a) The discretizable distance geometry problem. Optim. Lett. 6(8):1671–1686.Google Scholar
• Mucherino A, Lavor C, Liberti L, Maculan N (2012b) Distance Geometry: Theory, Methods, and Applications (Springer Science & Business Media, Berlin).Google Scholar
• Mucherino A, Omer J, Hoyet L, Giordano PR, Multon F (2018) An application-based characterization of dynamical distance geometry problems. Optim. Lett. 14(2):1–15.Google Scholar
• Omer J, Gonçalves DS (2017) An integer programming approach for the search of discretization orders in distance geometry problems. Optim. Lett. 14(2):1–14.Google Scholar
• Saxe J (1980) Embeddability of Weighted Graphs in K-Space Is Strongly NP-Hard (Department of Computer Science, Carnegie-Mellon University, Pittsburgh).Google Scholar
• Tarjan RE (1976) Edge-disjoint spanning trees and depth-first search. Acta Inform. 6(2):171–185.Google Scholar