The following pages link to Andreas Lundell (Q249516):
Displaying 11 items.
- A reformulation framework for global optimization (Q367160) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Some transformation techniques with applications in global optimization (Q1029684) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- Global optimisation of a portfolio adjustment problem under credibility measures (Q2627680) (← links)
- Global Optimization of Mixed-Integer Signomial Programming Problems (Q2897303) (← links)
- Convex underestimation strategies for signomial functions (Q3396383) (← links)
- Improved Discrete Reformulations for the Quadratic Assignment Problem (Q4922912) (← links)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
- Design and cost optimization for hierarchical data (Q6668624) (← links)
