A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems

Jan Kronqvist, DE Bernal, Andreas Lundell, Tapio Westerlund

    Research output: Contribution to journalArticleScientificpeer-review

    4 Citations (Scopus)
    Original languageUndefined/Unknown
    Pages (from-to)105–113
    Number of pages9
    JournalComputers and Chemical Engineering
    Volume122
    DOIs
    Publication statusPublished - 2019
    MoE publication typeA1 Journal article-refereed

    Keywords

    • Cutting plane techniques
    • Center-cut algorithm
    • Primal heuristics
    • Convex MINLP
    • Outer approximation

    Cite this