Marcus Oswald

Learn More
This paper deals with the cutting-plane approach to the maximum stable set problem. We provide theoretical results regarding the facet-defining property of inequalities obtained by a known project-and-lift-style separation method called edge-projection, and its variants. An implementation of a Branch and Cut algorithm is described, which uses(More)
Malaria is one of the world's most common and serious diseases causing death of about 3 million people each year. Its most severe occurrence is caused by the protozoan Plasmodium falciparum. Biomedical research could enable treating the disease by effectively and specifically targeting essential enzymes of this parasite. However, the parasite has developed(More)
MOTIVATION Understanding regulation of transcription is central for elucidating cellular regulation. Several statistical and mechanistic models have come up the last couple of years explaining gene transcription levels using information of potential transcriptional regulators as transcription factors (TFs) and information from epigenetic modifications. The(More)
In this paper we consider a variant of the betweenness problem occurring in computational biology. We present a new polyhedral approach which incorporates the solution of consecutive ones problems and show that it supersedes an earlier one. A particular feature of this new branch-and-cut algorithm is that it is not based on an explicit integer programming(More)
MOTIVATION Gene expression profiling by microarrays or transcript sequencing enables observing the pathogenic function of tumors on a mesoscopic level. RESULTS We investigated neuroblastoma tumors that clinically exhibit a very heterogeneous course ranging from rapid growth with fatal outcome to spontaneous regression and detected regulatory oncogenetic(More)
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelling salesman polytope (TSP). Prominent examples are the quadratic assignment problem and the quadratic knapsack problem; further applications occur in various areas such as(More)
Abstract. The Graphical Traveling Salesman Polyhedron (GTSP) has been proposed by Naddef and Rinaldi to be viewed as a relaxation of the Symmetric Traveling Salesman Polytope (STSP). It has also been employed by Applegate, Bixby, Chvátal, and Cook for solving the latter to optimality by the Branch-and-Cut method. There is a close natural connection between(More)