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....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization letters Jg. 6; H. 1; S. 31 - 41
Hauptverfasser:	He, Xiaozheng, Chen, Anthony, Chaovalitwongse, Wanpracha A., Liu, Henry X.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer-Verlag 01.01.2012
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!