An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886): Difference between revisions

@@ Property / cites work @@
+Discretization vertex orders in distance geometry
@@ Property / cites work: Discretization vertex orders in distance geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal partial discretization orders for discretizable distance geometry
+Normal rank
@@ Property / cites work @@
+On extended formulations for the precedence constrained asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Algorithm for the Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Facets of the linear ordering polytope
@@ Property / cites work: Facets of the linear ordering polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Discretization orders for distance geometry problems
+Normal rank
@@ Property / cites work @@
+The discretizable molecular distance geometry problem
+Normal rank
@@ Property / cites work @@
+A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
+Normal rank
@@ Property / cites work @@
+Euclidean Distance Geometry and Applications
@@ Property / cites work: Euclidean Distance Geometry and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and depth-first search
+Normal rank