Penalty Parameter for Linearly Constrained 0–1 Quadratic Programming

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.116, Iss.1, 2003-01, pp. : 229-239

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

A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs

By Galli Laura Letchford Adam

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1213-1224

Springer Publishing Company

Access to resources Recommend Favorite

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

By Çela Eranda Klinz Bettina Meyer Christophe

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 187-215

Springer Publishing Company

Access to resources Recommend Favorite

A Proportioning Based Algorithm with Rate of Convergence for Bound Constrained Quadratic Programming

By Dostál Z.

Numerical Algorithms, Vol. 34, Iss. 2-4, 2003-12 ,pp. : 293-302

Springer Publishing Company

Access to resources Recommend Favorite

A sequential method for a class of box constrained quadratic programming problems

By Cambini Riccardo

Mathematical Methods of Operations Research, Vol. 67, Iss. 2, 2008-04 ,pp. : 223-243

Springer Publishing Company

Access to resources Recommend Favorite

A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization

By Jian Jin-Bao Yang Su-Min Tang Chun-Ming

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 463-482

Taylor & Francis Ltd

Access to resources Recommend Favorite