A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs

Author： Glover Fred   Sherali Hanif D.  

Publisher： Inderscience Publishers

ISSN： 1742-7185

Source： International Journal of Computational Science and Engineering, Vol.3, Iss.3, 2008-04, pp. : 203-210

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

Global solution of nonlinear mixed-integer bilevel programs

By Mitsos Alexander  

Journal of Global Optimization, Vol. 47, Iss. 4, 2010-08 ,pp. : 557-582

Springer Publishing Company

Access to resources Recommend Favorite

Multi-piece mould design based on a mixed-integer programming method

By Chen Yong   Stoyan Stephen  

International Journal of Computer Integrated Manufacturing, Vol. 26, Iss. 10, 2013-10 ,pp. : 939-954

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mixed-integer programming—1968 and thereafter

By Padberg Manfred  

Annals of Operations Research, Vol. 149, Iss. 1, 2007-02 ,pp. : 163-175

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm for non-linear multi-level integer programming problems

By Arora Ritu  

International Journal of Computing Science and Mathematics, Vol. 3, Iss. 3, 2010-12 ,pp. : 211-225

Inderscience Publishers

Access to resources Recommend Favorite