Tapio Westerlund

According to our database1, Tapio Westerlund authored at least 32 papers between 1979 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems.
Comput. Chem. Eng., 2019

2018
On solving generalized convex MINLP problems using supporting hyperplane techniques.
J. Glob. Optim., 2018

Reformulations for utilizing separability when solving convex MINLP problems.
J. Glob. Optim., 2018

Solving global optimization problems using reformulations and signomial transformations.
Comput. Chem. Eng., 2018

2017
Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems.
J. Glob. Optim., 2017

2016
The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming.
J. Glob. Optim., 2016

2014
New methods for calculating α BB-type underestimators.
J. Glob. Optim., 2014

2013
A reformulation framework for global optimization.
J. Glob. Optim., 2013

Improved Discrete Reformulations for the Quadratic Assignment Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
A Generalization of the Classical αBB Convex Underestimation via Diagonal and Nondiagonal Quadratic Terms.
J. Optim. Theory Appl., 2012

A new exact discrete linear reformulation of the quadratic assignment problem.
Eur. J. Oper. Res., 2012

2011
A Comparative Study of Solving Quadratic Assignment Problems using Some Standard MINLP Solvers.
Proceedings of the SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Noordwijkerhout, The Netherlands, 29, 2011

2010
A linear programming-based optimization algorithm for solving nonlinear programming problems.
Eur. J. Oper. Res., 2010

2009
Sequential Cutting Plane Algorithm.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Extended Cutting Plane Algorithm.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

MINLP: Trim-loss Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Convex underestimation strategies for signomial functions.
Optim. Methods Softw., 2009

Some transformation techniques with applications in global optimization.
J. Glob. Optim., 2009

2008
Global solution of optimization problems with signomial parts.
Discret. Optim., 2008

2007
A MILP model for N-dimensional allocation.
Comput. Chem. Eng., 2007

2006
A sequential cutting plane algorithm for solving convex NLP problems.
Eur. J. Oper. Res., 2006

Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm.
Comput. Optim. Appl., 2006

2005
An epsilon-accurate model for optimal unequal-area block layout design.
Comput. Oper. Res., 2005

Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods.
Comput. Chem. Eng., 2005

2004
Comparisons of solving a chromatographic separation problem using MINLP methods.
Comput. Chem. Eng., 2004

2003
Some convexifications in global optimization of problems containing signomial terms.
Comput. Chem. Eng., 2003

2002
Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure.
Eur. J. Oper. Res., 2002

1998
Different transformations for solving non-convex trim-loss problems by MINLP.
Eur. J. Oper. Res., 1998

1991
An elementary derivation of the maximum likelihood estimator of the covariance matrix, and an illustrative determinant inequality.
Autom., 1991

1984
Constrained linear quadratic gaussian control with process applications.
Autom., 1984

1979
Reply by toivonen and westerlund.
Autom., 1979

Comments on self-tuning regulator applied to a binary distillation column.
Autom., 1979


  Loading...