We study unconstrained quadratic zero-one programming problems having n variables from a polyhedral point of view by considering the Boolean quadric polytope QP" in n(n+l)/2 dimensions that resultsâ€¦ (More)

An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cutting-plane procedure thatâ€¦ (More)

A z e r o o n e matr ix is called perfect if the polytope of the associated set packing problem has integral vertices only. By this definition, all totally unimodular z e r o o n e matrices areâ€¦ (More)