A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem
Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is considered as a unified model for a variety of combinatorial optimization problems. Recently, a multi-objective UBQP (mUBQP) is defined and a set of mU...
Saved in:
| Published in: | 2013 Sixth International Conference on Advanced Computational Intelligence (ICACI) pp. 281 - 286 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.10.2013
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!