Pages that link to "Item:Q2174886"

The following pages link to An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886):

Displaying 11 items.

• Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
• Discretization vertex orders in distance geometry (Q499358) (← links)
• Discretization orders for distance geometry problems (Q691496) (← links)
• MinDouble (Q1350406) (← links)
• The minimum distance superset problem: formulations and algorithms (Q1756748) (← links)
• The discretizable distance geometry problem (Q1926615) (← links)
• The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
• The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (Q2174889) (← links)
• Optimal partial discretization orders for discretizable distance geometry (Q2827765) (← links)
• On the Identification of Discretization Orders for Distance Geometry with Intervals (Q5410538) (← links)
• Constraint programming approaches for the discretizable molecular distance geometry problem (Q6065908) (← links)