Discrete Applied Mathematics, Volume 26

Volume 26, Number 1, January 1990

• Jørgen Bang-Jensen, Pavol Hell:
  The effect of two cycles on the complexity of colourings by directed graphs. 1-23
  Electronic Edition (link) BibTeX
• Frank E. Bennett, Lisheng Wu:
  On minimum matrix representation of closure operations. 25-40
  Electronic Edition (link) BibTeX
• Dominique de Werra, L. Jacot-Descombes, P. Masson:
  A constrained sports scheduling problem. 41-49
  Electronic Edition (link) BibTeX
• Olivier Dubois:
  On the r, s-SAT satisfiability problem and a conjecture of Tovey. 51-60
  Electronic Edition (link) BibTeX
• Matteo Fischetti:
  A new linear storage, polynomial-time approximation scheme for the subset-sum problem. 61-77
  Electronic Edition (link) BibTeX
• Fred H. Hao:
  The optimal procedures for quantitative group testing. 79-86
  Electronic Edition (link) BibTeX
• Santosh N. Kabadi, Ramaswamy Chandrasekaran:
  On totally dual integral systems. 87-104
  Electronic Edition (link) BibTeX
• Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
  The complexity of finding two disjoint paths with min-max objective function. 105-115
  Electronic Edition (link) BibTeX
• Alica Kelemenová:
  Size of context in regenerative IL systems. 117-119
  Electronic Edition (link) BibTeX
• J. W. Kennedy, K. A. McKeon, Edgar M. Palmer, Robert W. Robinson:
  Asymptotic number of symmetries in locally restricted trees. 121-124
  Electronic Edition (link) BibTeX

Volume 26, Numbers 2-3, March 1990

• Robert G. Jeroslow:
  Two mixed integer programming formulations arising in manufacturing management. 137-157
  Electronic Edition (link) BibTeX
• Martin E. Dyer, Alan M. Frieze:
  On an optimization problem with nested constraints. 159-173
  Electronic Edition (link) BibTeX
• Ronny Aboudi, Kurt Jørnsten:
  Resource constrained assignment problems. 175-191
  Electronic Edition (link) BibTeX
• Gilbert Laporte, Silvano Martello:
  The selective travelling salesman problem. 193-207
  Electronic Edition (link) BibTeX
• T. H. C. Smith, T. W. S. Meyer, G. L. Thompson:
  Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations. 209-217
  Electronic Edition (link) BibTeX
• W. L. Price, F. W. Woodhams:
  Combinatorial optimisation algorithms for a CAD workstation. 219-233
  Electronic Edition (link) BibTeX
• T. S. Abdul-Razaq, C. N. Potts, Luk N. Van Wassenhove:
  A survey of algorithms for the single machine total weighted tardiness scheduling problem. 235-253
  Electronic Edition (link) BibTeX
• Martin E. Dyer, Laurence A. Wolsey:
  Formulating the single machine sequencing problem with release dates as a mixed integer program. 255-270
  Electronic Edition (link) BibTeX
• Eugeniusz Nowicki, Stanislaw Zdrzalka:
  A survey of results for sequencing problems with controllable processing times. 271-287
  Electronic Edition (link) BibTeX
• Josep Rifà, Ll. Huguet:
  Classification of a class of distance-regular graphs via completely regular codes. 289-300
  Electronic Edition (link) BibTeX