default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTapio Westerlund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]Andreas Lundell
, Jan Kronqvist, Tapio Westerlund:
The supporting hyperplane optimization toolkit for convex MINLP. J. Glob. Optim. 84(1): 1-41 (2022)
2010 – 2019
- 2019
- [j27]Jan Kronqvist, David E. Bernal, Andreas Lundell, Tapio Westerlund:
A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems. Comput. Chem. Eng. 122: 105-113 (2019) - 2018
- [j26]Andreas Lundell, Tapio Westerlund:
Solving global optimization problems using reformulations and signomial transformations. Comput. Chem. Eng. 116: 122-134 (2018) - [j25]Jan Kronqvist, Andreas Lundell, Tapio Westerlund:
Reformulations for utilizing separability when solving convex MINLP problems. J. Glob. Optim. 71(3): 571-592 (2018) - [j24]Tapio Westerlund, Ville-Pekka Eronen, Marko M. Mäkelä:
On solving generalized convex MINLP problems using supporting hyperplane techniques. J. Glob. Optim. 71(4): 987-1011 (2018) - 2017
- [j23]Ville-Pekka Eronen, Jan Kronqvist, Tapio Westerlund, Marko M. Mäkelä, Napsu Karmitsa:
Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems. J. Glob. Optim. 69(2): 443-459 (2017) - 2016
- [j22]Jan Kronqvist, Andreas Lundell, Tapio Westerlund:
The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 64(2): 249-272 (2016) - 2014
- [j21]Anders Skjäl, Tapio Westerlund:
New methods for calculating α BB-type underestimators. J. Glob. Optim. 58(3): 411-427 (2014) - 2013
- [j20]Andreas Lundell, Anders Skjäl, Tapio Westerlund:
A reformulation framework for global optimization. J. Glob. Optim. 57(1): 115-141 (2013) - [c2]Axel Nyberg, Tapio Westerlund, Andreas Lundell:
Improved Discrete Reformulations for the Quadratic Assignment Problem. CPAIOR 2013: 193-203 - 2012
- [j19]Axel Nyberg, Tapio Westerlund:
A new exact discrete linear reformulation of the quadratic assignment problem. Eur. J. Oper. Res. 220(2): 314-319 (2012) - [j18]Anders Skjäl, Tapio Westerlund, Ruth Misener, Christodoulos A. Floudas:
A Generalization of the Classical αBB Convex Underestimation via Diagonal and Nondiagonal Quadratic Terms. J. Optim. Theory Appl. 154(2): 462-490 (2012) - 2011
- [c1]Toni Lastusilta, Tapio Westerlund:
A Comparative Study of Solving Quadratic Assignment Problems using Some Standard MINLP Solvers. SIMULTECH 2011: 409-412 - 2010
- [j17]Claus Still, Tapio Westerlund:
A linear programming-based optimization algorithm for solving nonlinear programming problems. Eur. J. Oper. Res. 200(3): 658-670 (2010)
2000 – 2009
- 2009
- [j16]Andreas Lundell, Joakim Westerlund, Tapio Westerlund:
Some transformation techniques with applications in global optimization. J. Glob. Optim. 43(2-3): 391-405 (2009) - [j15]Andreas Lundell, Tapio Westerlund:
Convex underestimation strategies for signomial functions. Optim. Methods Softw. 24(4-5): 505-522 (2009) - [r3]Claus Still, Tapio Westerlund:
Extended Cutting Plane Algorithm. Encyclopedia of Optimization 2009: 959-966 - [r2]Iiro Harjunkoski, Ray Pörn, Tapio Westerlund:
MINLP: Trim-loss Problem. Encyclopedia of Optimization 2009: 2190-2198 - [r1]Claus Still, Tapio Westerlund:
Sequential Cutting Plane Algorithm. Encyclopedia of Optimization 2009: 3471-3476 - 2008
- [j14]Ray Pörn, Kaj-Mikael Björk, Tapio Westerlund:
Global solution of optimization problems with signomial parts. Discret. Optim. 5(1): 108-120 (2008) - 2007
- [j13]Joakim Westerlund, Lazaros G. Papageorgiou, Tapio Westerlund:
A MILP model for N-dimensional allocation. Comput. Chem. Eng. 31(12): 1702-1714 (2007) - 2006
- [j12]Claus Still, Tapio Westerlund:
Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm. Comput. Optim. Appl. 34(1): 63-83 (2006) - [j11]Claus Still, Tapio Westerlund:
A sequential cutting plane algorithm for solving convex NLP problems. Eur. J. Oper. Res. 173(2): 444-464 (2006) - 2005
- [j10]Ignacio Castillo, Joakim Westerlund, Stefan Emet, Tapio Westerlund:
Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30(1): 54-69 (2005) - [j9]Ignacio Castillo, Tapio Westerlund:
An epsilon-accurate model for optimal unequal-area block layout design. Comput. Oper. Res. 32: 429-447 (2005) - 2004
- [j8]Stefan Emet, Tapio Westerlund:
Comparisons of solving a chromatographic separation problem using MINLP methods. Comput. Chem. Eng. 28(5): 673-682 (2004) - 2003
- [j7]Kaj-Mikael Björk, Per Olov Lindberg, Tapio Westerlund:
Some convexifications in global optimization of problems containing signomial terms. Comput. Chem. Eng. 27(5): 669-679 (2003) - 2002
- [j6]Janne Roslöf, Iiro Harjunkoski, Tapio Westerlund, Johnny Isaksson:
Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure. Eur. J. Oper. Res. 138(1): 29-42 (2002)
1990 – 1999
- 1998
- [j5]Iiro Harjunkoski, Tapio Westerlund, Ray Pörn, Hans Skrifvars:
Different transformations for solving non-convex trim-loss problems by MINLP. Eur. J. Oper. Res. 105(3): 594-603 (1998) - 1991
- [j4]Seppo Karrila, Tapio Westerlund:
An elementary derivation of the maximum likelihood estimator of the covariance matrix, and an illustrative determinant inequality. Autom. 27(2): 425-426 (1991)
1980 – 1989
- 1984
- [j3]Pertti M. Mäkilä, Tapio Westerlund, Hannu T. Toivonen:
Constrained linear quadratic gaussian control with process applications. Autom. 20(1): 15-29 (1984)
1970 – 1979
- 1979
- [j2]Hannu T. Toivonen, Tapio Westerlund:
Comments on self-tuning regulator applied to a binary distillation column. Autom. 15(2): 223-224 (1979) - [j1]Hannu T. Toivonen, Tapio Westerlund:
Reply by toivonen and westerlund. Autom. 15(2): 226 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
