A hybrid metaheuristic approach to solving the UBQP problem

From MaRDI portal
Publication:613436

DOI10.1016/j.ejor.2010.06.039zbMath1206.90113OpenAlexW2099120658MaRDI QIDQ613436

Jin-Kao Hao, Zhipeng Lü, Fred Glover

Publication date: 20 December 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.039



Related Items

Heuristic search to the capacitated clustering problem, Metaheuristic Algorithms, The Bipartite QUBO, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, A sample average approximation approach to the berth allocation problem with uncertain tides, The bipartite quadratic assignment problem and extensions, Probabilistic GRASP-tabu search algorithms for the UBQP problem, Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints, A memetic algorithm to pack unequal circles into a square, The Boolean quadratic programming problem with generalized upper bound constraints, A quality and distance guided hybrid algorithm for the vertex separator problem, Memetic search for the max-bisection problem, \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance, A two-phase tabu search based evolutionary algorithm for the maximum diversity problem, The unconstrained binary quadratic programming problem: a survey, Stochastic local search and parameters recommendation: a case study on flowshop problems, Solving unconstrained binary quadratic programming problem by global equilibrium search, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Path relinking for unconstrained binary quadratic programming, Modelling transfer line design problem via a set partitioning problem, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases, A hybrid metaheuristic method for the maximum diversity problem


Uses Software


Cites Work