An interior-point Benders based branch-and-cut algorithm for mixed integer programs

ISSN： 0254-5330

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

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

Classical Cuts for Mixed-Integer Programming and Branch-and-Cut

By Padberg Manfred

Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. : 321-352

Springer Publishing Company

Access to resources Recommend Favorite

A branch-and-cut algorithm for two-stage stochastic mixed-binary programs with continuous first-stage variables

By Ntaimo Lewis Sen Suvrajeet

International Journal of Computational Science and Engineering, Vol. 3, Iss. 3, 2008-04 ,pp. : 232-241

Inderscience Publishers

Access to resources Recommend Favorite

Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm

By Castro Jordi

Annals of Operations Research, Vol. 124, Iss. 1-4, 2003-01 ,pp. : 35-48

Springer Publishing Company

Access to resources Recommend Favorite

A decomposition-based solution method for stochastic mixed integer nonlinear programs

By Bruni Maria

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 343-346

Springer Publishing Company

Access to resources Recommend Favorite

A multiprocessor interior point algorithm

By Östermark Ralf Saarinen Martin

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 25, Iss. 4, 1996-04 ,pp. : 84-100

Emerald Group Publishing Ltd

Access to resources Recommend Favorite