An improved linearization technique for a class of quadratic 0-1 programming problems

The recent research on linearization techniques for solving 0-1 quadratic programming problems focuses on providing concise models and tightening constraint bounds. In this paper, we propose a computational enhancement for a linearization technique to make the linearized model much faster to solve....

Celý popis

Podrobná bibliografia

Vydané v:	Optimization letters Ročník 6; číslo 1; s. 31 - 41
Hlavní autori:	He, Xiaozheng, Chen, Anthony, Chaovalitwongse, Wanpracha A., Liu, Henry X.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer-Verlag 01.01.2012
Predmet:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Linearization technique Binary quadratic programming problem Hub location problem
ISSN:	1862-4472, 1862-4480
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!