#### Filter Results:

#### Publication Year

1987

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The Molecular Distance Geometry Problem consists in finding the positions in R 3 of the atoms of a molecule, given some of the inter-atomic distances. We show that under an additional requirement on the given distances (which is realistic from the chemical point of view) this can be transformed to a combinatorial problem. We propose a Branch-and-Prune… (More)

Given a simple weighted undirected graph G = 3 such that ||xu − xv|| = duv for each {u, v} ∈ E. We show that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space. We call this MDGP subclass the Discretizable MDGP (DMDGP). We show that the DMDGP is NP-hard and we propose a solution algorithm called… (More)

—NMR experiments are able to provide some of the distances between pairs of hydrogen atoms in molecular conformations. The problem of finding the coordinates of such atoms is known as the molecular distance geometry problem. This problem can be reformulated as a combinatorial optimization problem and efficiently solved by an exact algorithm. To this… (More)

Given an undirected graph G with penalties associated with its vertices and costs associated with its edges, a Prize Collecting Steiner (PCS) tree is either an isolated vertex of G or else any tree of G, be it spanning or not. The weight of a PCS tree equals the sum of the costs for its edges plus the sum of the penalties for the vertices of G not spanned… (More)

This work presents an integer programming formulation for a variant of the Class-Teacher Timetabling problem, which considers the satisfaction of teacher preferences and also the proper distribution of lessons throughout the week. The formulation contains a very large number of variables and is enhanced by cuts. Therefore, a cut and column generation… (More)