A p-cone sequential relaxation procedure for 0-1 integer programs

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.24, Iss.4-5, 2009-08, pp. : 523-548

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 Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover

By Fujito Toshihiro

Journal of Combinatorial Optimization, Vol. 8, Iss. 4, 2004-12 ,pp. : 439-452

Springer Publishing Company

Access to resources Recommend Favorite

On Valid Inequalities for Mixed Integer p-Order Cone Programming

By Vinel Alexander Krokhmal Pavlo

Journal of Optimization Theory and Applications, Vol. 160, Iss. 2, 2014-02 ,pp. : 439-456

Springer Publishing Company

Access to resources Recommend Favorite

Initial ideals of unimodular integer programs

By Ito Masafumi Hirabayashi Ryuichi

International Journal of Computer Mathematics, Vol. 82, Iss. 12, 2005-12 ,pp. : 1429-1445

Taylor & Francis Ltd

Access to resources Recommend Favorite

Variational analysis of circular cone programs

Optimization, Vol. 64, Iss. 1, 2015-01 ,pp. : 113-147

Taylor & Francis Ltd

Access to resources Recommend Favorite

Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach

By Zheng X. Sun X. Li D.

Journal of Optimization Theory and Applications, Vol. 146, Iss. 2, 2010-08 ,pp. : 463-489

Springer Publishing Company

Access to resources Recommend Favorite