A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints

Author： Shim Yohan   Fodstad Marte   Gabriel Steven   Tomasgard Asgeir  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.210, Iss.1, 2013-11, pp. : 5-31

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

Abstract

Related content

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

By Kolpakov R.   Posypkin M.   Sigal I.  

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2152-2161

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints

By Sahinidis Nikolaos   Tawarmalani Mohit  

Journal of Global Optimization, Vol. 32, Iss. 2, 2005-06 ,pp. : 259-280

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Based Method for Solving Monotone Optimization Problems

By Sun X.   Li J.  

Journal of Global Optimization, Vol. 35, Iss. 2, 2006-06 ,pp. : 367-385

Springer Publishing Company

Access to resources Recommend Favorite

Partial Augmented Lagrangian Method and Mathematical Programs with Complementarity Constraints

By Huang X.   Yang X.   Teo K.  

Journal of Global Optimization, Vol. 35, Iss. 2, 2006-06 ,pp. : 235-254

Springer Publishing Company

Access to resources Recommend Favorite

Mathematical Programming with System of Equilibrium Constraints

By Lin Lai-Jiu  

Journal of Global Optimization, Vol. 37, Iss. 2, 2007-02 ,pp. : 275-286

Springer Publishing Company

Access to resources Recommend Favorite