The following pages link to Jan Kronqvist (Q249515):
Displaying 10 items.
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems (Q1679493) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
- A mixed-integer approximation of robust optimization problems with mixed-integer adjustments (Q6427814) (← links)
