Iterated tabu search for the unconstrained binary quadratic optimization problem

MaRDI QIDQ5491984zbMATH OpenFDO

Authors Gintaras Palubeckis

Publication date 12 October 2006

zbMATH Keywords

heuristicsiterated tabu searchbinary quadratic optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• Diversification-driven tabu search for unconstrained binary quadratic problems
• The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• Solving the quadratic assignment problem by the repeated iterated tabu search method

Cited in

(19)

• Algorithm unions for solving discrete optimization problems
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
• Solving unconstrained binary quadratic programming problem by global equilibrium search
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• The unconstrained binary quadratic programming problem: a survey
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
• Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
• scientific article; zbMATH DE number 1985661 (Why is no real title available?)
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• scientific article; zbMATH DE number 1296790 (Why is no real title available?)
• Metaheuristic algorithms
• The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
• A hybrid metaheuristic approach to solving the UBQP problem
• Path relinking for unconstrained binary quadratic programming
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• Capping methods for the automatic configuration of optimization algorithms
• A branch-and-bound algorithm for the minimum cut linear arrangement problem
• Building an iterative heuristic solver for a quantum annealer

This page was built for publication: Iterated tabu search for the unconstrained binary quadratic optimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491984)