Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem

The bipartite unconstrained 0-1 quadratic programming problem (BQP) is a difficult combinatorial problem defined on a complete graph that consists of selecting a subgraph that maximizes the sum of the weights associated with the chosen vertices and the edges that connect them. The problem has appear...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 51; pp. 123 - 129
Main Authors:	Duarte, Abraham, Laguna, Manuel, Martí, Rafael, Sánchez-Oro, Jesús
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier Ltd 01.11.2014 Elsevier Pergamon Press Inc
Subjects:	Applied sciences Benchmarks Branch & bound algorithms Branch and bound Combinatorics Computer science; control theory; systems Exact sciences and technology Flows in networks. Combinatorial problems Graphs Heuristic Heuristic search Information retrieval. Graph Iterated local search Mathematical problems Mathematical programming Operational research and scientific management Operational research. Management science Quadratic programming Studies Tabu search Theoretical computing Heuristic search Branch and bound Tabu search Quadratic programming Iterated local search Local search Unconstrained optimization Complete graph Branch and bound method Combinatorial problem Matrix factorization Matrix decomposition Combinatorial optimization Zero one programming Graph connectivity Graph cut Implicit enumeration method Heuristic method Subgraph Bipartite graph
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!