1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.OC2022
Leveraging Decision Diagrams to Solve Two-stage Stochastic Programs with Binary Recourse and Logical Linking Constraints
Moira MacNeil, Merve Bodur
Two-stage stochastic programs with binary recourse are challenging to solve and efficient solution methods for such problems have been limited. In this work, we generalize an exist…
math.OC2019★ 1 cited
Constraint Programming Approaches to the Discretizable Molecular Distance Geometry Problem
Moira MacNeil, Merve Bodur
The Distance Geometry Problem (DGP) seeks to find positions for a set of points in geometric space when some distances between pairs of these points are known. The so-called discre…
math.OC2019★ 1 cited
Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
Moira MacNeil, Merve Bodur
Given an integer dimension K and a simple, undirected graph G with positive edge weights, the Distance Geometry Problem (DGP) aims to find a realization function mapping each verte…