Constructing new facets of the consecutive ones polytope

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2570, Issue , 2003, Pages 147-157

  Oswald, Marcus ^a   Reinelt, Gerhard ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION; TOPOLOGY;

BETWEENNESS; CONSECUTIVE ONES; CONSECUTIVE ONES PROBLEM; POLYNOMIAL-TIME; POLYTOPES;

PROBLEM SOLVING;

EID: 35248883955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36478-1_14     Document Type: Article

References (4)

1. T. Christof, A. Loebel (1998) PORTA - A Polyhedron Representation Algorithm. www.informatik.uni-heidelberg.de/groups/comopt/software/PORTA
2. T. Christof, M. Oswald and G. Reinelt (1998) Consecutive Ones and A Betweenness Problem in Computational Biology. Proceedings of the 6th IPCO Conference, Houston, 213-228
3. M. Oswald and G. Reinelt (2000) Polyhedral Aspects of the Consecutive Ones Problem, Proceedings of the 5th Conference on Computing and Combinatorics, Sydney, 373-382
4. M. Oswald and G. Reinelt (2001) Some Relations Between Consecutive Ones and Betweenness Polytopes, to appear in: Proceedings of OR2001, Selected Papers, Duisburg