Reformulations for utilizing separability when solving convex MINLP problems

    Research output: Contribution to journalArticleScientificpeer-review

    5 Citations (Scopus)
    Original languageUndefined/Unknown
    Pages (from-to)571–592
    Number of pages22
    JournalJournal of Global Optimization
    Volume71
    Issue number3
    DOIs
    Publication statusPublished - 2018
    MoE publication typeA1 Journal article-refereed

    Keywords

    • Convex MINLP
    • Lifted polyhedral approximation
    • Separable MINLP
    • Extended supporting hyperplane algorithm
    • Outer approximation
    • extended cutting plane algorithm

    Cite this