Skip to main content
SpringerLink
Log in

More on a Binary-Encoded Coloring Formulation

  • Conference paper
Integer Programming and Combinatorial Optimization (IPCO 2004)

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

Abstract

We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficient separation algorithm for general block inequalities, (ii) an efficient LP-based separation algorithm for stars (i.e., the all-different polytope), (iii) introduction of matching inequalities, and (iv) introduction of switched path inequalities and their efficient separation, (v) a complete description for paths, (vi) promising computational results.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1-3), 21–46 (1996); First International Colloquium on Graphs and Optimization (GOI), (Grimentz) (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chetwynd, A.G., Wilson, R.J.: The rise and fall of the critical graph conjecture. J. Graph Theory 7(2), 153–157 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  3. COIN-OR (2003), www.coin-or.org

  4. Coppersmith, D., Lee, J.: Parsimonious binary-encoding in integer programming. IBM Research Report RC23838 (2003)

    Google Scholar 

  5. Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, 2nd edn. Algorithms and Combinatorics, vol. 2. Springer, Berlin (1993)

    MATH  Google Scholar 

  6. Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718–720 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lee, J.: All-different polytopes. J. Comb. Optim. 6(3), 335–352 (2002); New approaches for hard discrete optimization (Waterloo, ON, 2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lee, J., Leung, J., de Vries, S.: Separating type-I odd-cycle inequalities for a binary encoded edge-coloring formulation. IBM Research Report RC22303 (2002); to appear in: Journal of Combinatorial Optimization

    Google Scholar 

  9. Kipp Martin, R.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119–128 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Vazirani, V.V.: A theory of alternating paths and blossoms for proving correctness of the O(\(\sqrt{V}\) E) general graph maximum matching algorithm. Combinatorica 14, 71–109 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz No. 3, 25–30 (1964)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM T.J. Watson Research Center, Yorktown Heights, NY, 10598, U.S.A.

    Jon Lee

  2. Carnegie Mellon University, Pittsburgh, PA, 15213-3890, USA

    François Margot

Authors
  1. Jon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. François Margot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of IEOR, Columbia University, 500 West 120th Street, 10027, New York, NY, USA

    Daniel Bienstock

  2. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA

    George Nemhauser

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, J., Margot, F. (2004). More on a Binary-Encoded Coloring Formulation. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25960-2_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22113-5

  • Online ISBN: 978-3-540-25960-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation