A note on polynomial solvability of the CDT problem

  • Daniel Bienstock
    • Categories Constrained Nonlinear Optimization, Convex and Nonsmooth Optimization, Quadratic Programming Tags , , Short URL: https://optimization-online.org/?p=12696

    We describe a simple polynomial-time algorithm for the CDT problems that relies on a construction of Barvinok.

    Citation

    Columbia University

    Article

    Download

    View A note on polynomial solvability of the CDT problem