Multiobjective Binary ACO for Unconstrained Binary Quadratic Programming

The Unconstrained Binary Quadratic Programming (UBQP) is a NP-hard problem able to represent a wide range of combinatorial optimization problems. The problem has grown in importance due to its potential application and its computational challenge. Recently, the problem was extended to multiobjective...

Celý popis

Podrobná bibliografia

Vydané v:	2015 Brazilian Conference on Intelligent Systems (BRACIS) s. 86 - 91
Hlavní autori:	De Souza, Murilo Zangari, Pozo, Aurora Trinidad Ramirez
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2015
Predmet:	Ant colony optimization Approximation algorithms Binary Ant Colony Optimization (BACO) Evolutionary computation Linear programming Multiobjective Optimization Problems (MOPs) Multiobjective Unconstrained Binary Quadratic Programming (mUBQP) Pareto optimization Quadratic programming
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!