Now showing items 1-2 of 2

    • ADMM for SDP Relaxation of GP 

      Sun, Hao (University of Waterloo, 2016-08-30)
      We consider the problem of partitioning the set of nodes of a graph G into k sets of given sizes in order to minimize the cut obtained after removing the k-th set. This is a variant of the well-known vertex separator ...
    • Primal Cutting Plane Methods for the Traveling Salesman Problem 

      Stratopoulos, Christos (University of Waterloo, 2017-04-26)
      Most serious attempts at solving the traveling salesman problem (TSP) are based on the dual fractional cutting plane approach, which moves from one lower bound to the next. This thesis describes methods for implementing ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages