Skip to main content
SpringerLink
Log in

A TDI Description of Restricted 2-Matching Polytopes

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

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

Abstract

We give a TDI description for a class of polytopes, which corresponds to a restricted 2-matching problem. The perfect matching polytope, triangle-free perfect 2-matching polytope and relaxations of the travelling salesman polytope are members of this class. The paper shows that 2-matching problems for which the unweighted problem was known to be tractable, the weighted is also tractable.

Research supported by the Hungarian National Foundation for Scientific Research Grant, OTKA T037547.

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. Cornuéjols, G., Hartvigsen, D.: An extension of matching theory. J. Combin. Theory Ser. B 40, 285–296 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cornuéjols, G., Pulleyblank, W.R.: A matching problem with side conditions. Discrete Mathematics 29, 135–159 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cornuéjols, G., Pulleyblank, W.R.: Critical graphs, matchings and tours or a hierarchy of the travelling salesman problem. Combinatorica 3(1), 35–52 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cornuéjols, G., Pulleyblank, W.R.: The travelling salesman polytope and {0, 2}- matchings. Annals of Discrete Mathematics 16, 27–55 (1982)

    Google Scholar 

  5. Cunningham, W.H., Marsh III, A.B.: A primal algorithm for optimum matching. Math. Programming Stud. 8, 50–72 (1978)

    MathSciNet  Google Scholar 

  6. Lovász, L., Plummer, M.D.: Matching Theory. Akadémiai Kiadó, Budapest (1986)

    MATH  Google Scholar 

  7. Edmonds, J.: Maximum matching and a polyhedron with 0,1 vertices. Journal of Research National Bureau of Standards Section B 69, 125–130 (1965)

    MATH  MathSciNet  Google Scholar 

  8. Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. In: Studies in Integer Programming (Proceedings Workshop on Integer Programming, Bonn (1975); Hammer, P.L., Johnson, E.L., Korte, B.H., Nemhauser, G.L. (eds.): Annals of Discrete Mathematics 1, pp. 185–204. North Holland, Amsterdam (1977)

    Google Scholar 

  9. Loebl, M.: personal communication (2004)

    Google Scholar 

  10. Pap, P.: manuscript (2004)

    Google Scholar 

  11. Pulleyblank, W.R., Edmonds, J.: Facets of 1-matching polyhedra. In: Hypergraph Seminar (Proceedings Working Seminar on Hypergraphs, Colombus, Ohio (1972); Berge, C., Ray-Chaudhouri, D. (eds.): pp. 214–242. Springer, Berlin (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Eötvös University, Budapest, Hungary

    Gyula Pap

Authors
  1. Gyula Pap
    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

Pap, G. (2004). A TDI Description of Restricted 2-Matching Polytopes. 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_11

Download citation

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

  • 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