Skip to main content

Constructing New Facets of the Consecutive Ones Polytope

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2570))

Abstract

In this paper we relate the consecutive ones problem to the betweenness problem by pointing out connections between their associated polytopes. We will prove some results about the facet structure of the betweenness polytope and show how facets of this polytope can be used to generate facets of the consecutive ones polytope. Furthermore, the relations with the consecutive ones polytopes will enable us to conclude that the number of facets of the consecutive ones polytope only grows polynomially if the number of columns is fixed. This gives another proof of the fact that the consecutive ones problem is solvable in polynomial time in this case.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Christof, A. Loebel (1998) PORTA-A Polyhedron Representation Algorithm. http://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

    Google Scholar 

  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

    Google Scholar 

  4. M. Oswald and G. Reinelt (2001) Some Relations Between Consecutive Ones and Betweenness Polytopes, to appear in: Proceedings of OR2001, Selected Papers, Duisburg

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Oswald, M., Reinelt, G. (2003). Constructing New Facets of the Consecutive Ones Polytope. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds) Combinatorial Optimization — Eureka, You Shrink!. Lecture Notes in Computer Science, vol 2570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36478-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-36478-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00580-3

  • Online ISBN: 978-3-540-36478-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics