A disjunctive cut strengthening technique for convex MINLP
Work
Year: 2020
Type: article
Abstract: Generating polyhedral outer approximations and solving mixed-integer linear relaxations remains one of the main approaches for solving convex mixed-integer nonlinear programming (MINLP) problems. The... more
Source: Optimization and Engineering
Authors Jan Kronqvist, Ruth Misener
Institution Imperial College London
Cites: 73
Cited by: 13
Related to: 10
FWCI: 2.124
Citation percentile (by year/subfield): 90.42
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,990