A note on solving MINLP’s using formulation space search

ISSN： 1862-4472

Source： Optimization Letters, Vol.8, Iss.3, 2014-03, pp. : 1167-1182

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm

By Still Claus Westerlund Tapio

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 63-83

Springer Publishing Company

Access to resources Recommend Favorite

New MINLP formulation for the multiperiod pooling problem

AICHE JOURNAL, Vol. 61, Iss. 11, 2015-11 ,pp. : 3728-3738

John Wiley & Sons Inc

Access to resources Recommend Favorite

A note on solving linear Diophantine systems by using L3-reduction algorithm

By Khorramizadeh Mostafa

International Journal of Computer Mathematics, Vol. 86, Iss. 5, 2009-05 ,pp. : 883-896

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights

By van Maaren H.

Annals of Mathematics and Artificial Intelligence, Vol. 37, Iss. 3, 2003-03 ,pp. : 273-283

Springer Publishing Company

Access to resources Recommend Favorite

A note on a forcing related to the S‐space problem in the extension with a coherent Suslin tree

MLQ- MATHEMATICAL LOGIC QUARTERLY, Vol. 61, Iss. 3, 2015-05 ,pp. : 169-178

John Wiley & Sons Inc

Access to resources Recommend Favorite