Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems. McCormick, G. P. Mathematical Programming, 10(1):147–175, Springer Science and Business Media LLC, December, 1976.
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems [link]Paper  doi  bibtex   
@Article{McCormick1976,
    author      = {Garth P. McCormick},
    title       = {Computability of global solutions to factorable nonconvex programs: {Part} {I} {\textemdash} {Convex} underestimating problems},
    doi         = {10.1007/bf01580665},
    journal     = {Mathematical Programming},
    month       = {December},
    number      = {1},
    pages       = {147--175},
    publisher   = {Springer Science and Business Media {LLC}},
    url         = {https://doi.org/10.1007/bf01580665},
    volume      = {10},
    year        = {1976}
}

Downloads: 0