A New Heuristic for the Convex Quadratic Programming Problem

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

American Journal of Operations Research

ISSN Print: 2160-8830
ISSN Online: 2160-8849
www.scirp.org/journal/ajor
E-mail: ajor@scirp.org

Google-based Impact Factor: 0.84
Citations h5-index & Ranking*

Journals Menu

"A New Heuristic for the Convex Quadratic Programming Problem"
written by Elias Munapo, Santosh Kumar,
published by American Journal of Operations Research, Vol.5 No.5, 2015

has been cited by the following article(s):

Google Scholar
CrossRef

[1]	A Logarithmic Barrier Method Based On a New Majorant Function for Convex Quadratic Programming
	IAENG International Journal of Applied …, 2021

[2]	Linear Integer Programming
	Linear Integer Programming, 2021

[3]	DESEMPEÑO DE ALGORITMOS HEURÍSTICOS EN LA SOLUCIÓN DE PROBLEMAS CUADRÁTICOS NO CONVEXOS CON RESTRICCIONES DE CAJA
	2020

[4]	基于自适应有限冲激响应-卡尔曼滤波算法的 GPS/INS 导航.
	2019

[5]	A Procedure for Solving Quadratic Programming Problems
	2017

[6]	Second Proof That P= NP
	2016

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

American Journal of Operations Research

American Journal of Operations Research

Journals Menu

Home

About SCIRP

Service

Policies