Relaxations for some NP-hard problems based on exact subproblems
Author:
Franz Rendl
Date:
Thu, Aug 8, 2013 to Sat, Aug 10, 2013
Location:
PIMS, University of British Columbia
Conference:
Workshop on Numerical Linear Algebra and Optimization
Abstract:
Relaxations for some NP-hard problems based on exact subproblems. Joint work with E. Adams, M. Anjos (Montreal) and A. Wiegele (Klagenfurt).
Class:
Subject:
- 4169 reads
