Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem

Authors:
Gintaras Palubeckis
Affiliations:
Department of Practical Informatics, Kaunas University of Technology, Studentų 50, 51368 Kaunas, Lithuania, e-mail: gintaras@soften.ktu.lt
Venue:
Informatica
Year:
2006

Citing 13
Cited 12

An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Experiments in quadratic 0-1 programming

Mathematical Programming: Series A and B
Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
Quadratic Boolean programming for performance-driven system partitioning

DAC '93 Proceedings of the 30th international Design Automation Conference
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits

Mathematical Programming: Series A and B
Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

Mathematical Programming: Series A and B
A scatter search approach to unconstrained quadratic binary programs

New ideas in optimization
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Journal of Heuristics
Hierarchical Decision Making Framework for Evaluation and Improvement of Composite Systems (Example for Building)

Informatica
A Genetic Based Approach to the Type I Structure Identification Problem

Informatica
Iterated robust tabu search for MAX-SAT

AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Multiuser detection in CDMA - a comparison of relaxations, exact, and heuristic search methods

IEEE Transactions on Wireless Communications

Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem

Expert Systems with Applications: An International Journal
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems

International Journal of Metaheuristics
Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems

Expert Systems with Applications: An International Journal
A branch-and-bound algorithm for the single-row equidistant facility layout problem

OR Spectrum
A study of memetic search with multi-parent combination for UBQP

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Expert Systems with Applications: An International Journal
A multilevel algorithm for large unconstrained binary quadratic optimization

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A branch-and-bound algorithm for the minimum cut linear arrangement problem

Journal of Combinatorial Optimization
Multistart Iterated Tabu Search for Bandwidth Coloring Problem

Computers and Operations Research
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems

Journal of Heuristics
Backbone guided tabu search for solving the UBQP problem

Journal of Heuristics
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization problem consists in finding a subset of objects for which the overall profit is maximized. In this paper, an iterated tabu search algorithm for solving this problem is proposed. Computational results for problem instances of size up to 7000 variables (objects) are reported and comparisons with other up-to-date heuristic methods are provided.