The following pages link to Tapio Westerlund (Q249517):
Displaying 36 items.
- A reformulation framework for global optimization (Q367160) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- New methods for calculating \(\alpha\)BB-type underestimators (Q742131) (← links)
- (Q791494) (redirect page) (← links)
- Constrained linear quadratic Gaussian control with process applications (Q791497) (← links)
- An elementary derivation of the maximum likelihood estimator of the covariance matrix, and an illustrative determinant inequality (Q806893) (← links)
- Global solution of optimization problems with signomial parts (Q924639) (← links)
- Some transformation techniques with applications in global optimization (Q1029684) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- Comments on self-tuning regulator applied to a binary distillation column (Q1252828) (← links)
- Reply by Toivonen and Westerlund (Q1252832) (← links)
- Solving a two-dimensional trim-loss with MILP (Q1291689) (← links)
- Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782) (← links)
- Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure (Q1600885) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems (Q1679493) (← links)
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (Q1863894) (← links)
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design (Q1886847) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- Solving a dynamic separation problem using MINLP techniques (Q2480935) (← links)
- A sequential cutting plane algorithm for solving convex NLP problems (Q2496070) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- On modeling the dissolution of sedimentary rocks in acidic environments. an overview of selected mathematical methods with presentation of a case study (Q2517624) (← links)
- Global Optimization of Mixed-Integer Signomial Programming Problems (Q2897303) (← links)
- Convex underestimation strategies for signomial functions (Q3396383) (← links)
- (Q3646697) (← links)
- Remarks on "Asymptotic behavior of the extended Kalman filter as a parameter estimator for linear systems" (Q3892164) (← links)
- (Q4885818) (← links)
- Improved Discrete Reformulations for the Quadratic Assignment Problem (Q4922912) (← links)
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems (Q4981878) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- (Q5492521) (← links)
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
