1. On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions

   • M. Minoux

   Discrete Optimization Pages: 141 - 154

2. A projection technique for partitioning the nodes of a graph

   • Franz Rendl
   • Henry Wolkowicz

   Discrete Optimization Pages: 155 - 179

3. On some connections among variational inequalities, combinatorial and continuous optimization

   • F. Giannessi

   Discrete Optimization Pages: 181 - 200

4. Boolean regression

   • E. Boros
   • P. L. Hammer
   • J. N. Hooker

   Discrete Optimization Pages: 201 - 226

5. New results for aggregating integer-valued equations

   • Fred Glover
   • Djangir A. Babayev

   Discrete Optimization Pages: 227 - 242

6. Using integer programming techniques for the solution of an experimental design problem

   • Carl M. Harris
   • Karla L. Hoffman
   • Leslie-Ann Yarrow

   Discrete Optimization Pages: 243 - 260