TY - GEN
A1 - Dittel, Agnes
A1 - Fügenschuh, Armin
A1 - Martin, Alexander
T1 - Polyhedral Aspects of Self-Avoiding Walks
N2 - In this paper, we study self-avoiding walks of a given length on a graph. We consider a formulation of this problem as a binary linear program. We analyze the polyhedral structure of the underlying polytope and describe valid inequalities. Proofs for their facial properties for certain special cases are given. In a variation of this problem one is interested in optimal configurations, where an energy function measures the benefit if certain path elements are placed on adjacent vertices of the graph. The most prominent application of this problem is the protein folding problem in biochemistry. On a set of selected instances, we demonstrate the computational merits of our approach.
T3 - ZIB-Report - 11-11
KW - Polyhedral Combinatorics
KW - Integer Programming
KW - Self-Avoiding Path
KW - Protein Folding
Y1 - 2011
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1257
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-12576
ER -