Search results

Records found: 10  
Your query: Author Sysno = "^eu_un_auth p0039355^"
  1. ALON, N. - KATCHALSKI, M. - PULLEYBLANK, W.R. The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane. 1. ed. Bonn : Institut für Ökonometrie und Operations Research, 1987. 10 s. Report, No.87476-OR. [Copy count : 2, currently available 2, at library only 0]
    book

    book

  2. BALAS, E. - PULLEYBLANK, W.R. The Perfectly Matchable Subgraph Polytope of an Arbitrary Graph. 1. ed. Bonn : Institut für Ökonometrie und Operations Research, 1987. 26 s. Report, No.87470-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book

  3. ALON, N. - KATCHALSKI, M. - PULLEYBLANK, W.R. Cutting Disjoint Discs by Straight Lines. 1. ed. Bonn : Institut für Ökonometrie und Operations Research, 1987. 7 s. Report, No.87477-OR. [Copy count : 2, currently available 2, at library only 0]
    book

    book

  4. GAMBLE, A.B. - PULLEYBLANK, W.R. Forest Covers and Polyhedral Intersection Theorem. 1. ed. Bonn : Institut für Ökonometrie und Operations Research, 1987. 11 s. Report, No.87467-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book

  5. GAMBLE, A.B. - CONN, A.R. - PULLEYBLANK, W.R. A Network Penalty Method. Bonn : Institut für Ökonometrie und Operations Research, 1986. 28 s. Report, No. 86445-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book

  6. COOK, William - PULLEYBLANK, W.R. Linear systems for constrained matching problems. Bonn : Institut für Ökonometrie und Operations Research, 1984. 41 s. Report, no. 84323-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book

  7. JÜNGER, M. - PULLEYBLANK, W.R. - REINELT, G. On partitioning the edges of graphs into connected subgraphs. Bonn : Institut für Ökonometrie und Operations Research, 1982. 12 s. Report, no. 82251-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book

  8. GRÖTSCHEL, M. - PULLEYBLANK, W.R. Weakly dipartite graphs and max-cut problem. Bonn : Institut für Ökonometrie und Operations Research, 1981. 12 s. Report, No. 81194-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book

  9. CORNUEJOLS, G. - PULLEYBLANK, W.R. Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem. Bonn : Institut für Ökonometrie und Operations Research, 1981. 25 s. Report, No. 81198-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book

  10. PLUMMER, M.D. - PULLEYBLANK, W.R. On proximity to paths and cycles in 3- connected graphs. Bonn : Institut für Ökonometrie und Operations Research, 1981. 28 s. Report, No. 81192-OR. [Copy count : 1, currently available 1, at library only 0]
    book

    book



  This site uses cookies to make them easier to browse. Learn more about how we use cookies.