Consecutive Ones and a Betweenness Problem in Computational Biology
In this paper we consider a variant of the betweenness prob- lem 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 formulation of the problem and makes use of automatically generated facet-defining inequalities.
KeywordsLinear Order Quadratic Assignment Problem Integer Programming Formulation Incidence Vector Cycle Inequality
Unable to display preview. Download preview PDF.
- 2.K. S. Booth. PQ-Tree Algorithms. PhD thesis, University of California, Berkeley, 1975.Google Scholar
- 5.T. Christof and G. Reinelt. Efficient parallel facet enumeration for 0/1 polytopes. Technical report, University of Heidelberg, Germany, 1997.Google Scholar
- 6.T. Christof and G. Reinelt. Algorithmic aspects of using small instance relaxations in parallel branch-and-cut. Technical report, University of Heidelberg, Germany, 1998.Google Scholar
- 7.CPLEX. Using the CPLEX Callable Library. CPLEX Optimization, Inc, 1997.Google Scholar
- 8.M. Jain and E. W. Myers. Algorithms for computing and integrating physical maps using unique probes. In First Annual International Conference on Computational Molecular Biology, pages 84–92. ACM, 1997.Google Scholar
- 9.M. Jünger and S. Thienel. The design of the branch-and-cut system ABACUS. Technical Report 95.260, Universität zu Köln, Germany, 1997.Google Scholar
- 10.M. Jünger and S. Thienel. Introduction to ABACUS-A Branch-And-CUt system. Technical Report 95.263, Universität zu Köln, Germany, 1997.Google Scholar
- 11.S. Leipert. PQ-trees, an implementation as template class in C++. Technical Report 97.259, Universität zu Köln, Germany, 1997.Google Scholar
- 12.Y. Li, P. M. Pardalos, and M. G. C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P. M. Pardalos and H. Wolkowicz, editors, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, pages 237–261. American Mathematical Society, 1994.Google Scholar
- 13.M. Oswald. PQ-Bäume im Branch & Cut-Ansatz für das Physical-Mapping-Problem mit Endprobes. Master’s thesis, Universität Heidelberg, Germany, 1997.Google Scholar
- 14.S. Thienel. ABACUS A Branch-And-CUt System. PhD thesis, Universität zu Köln, 1995.Google Scholar