Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
From MaRDI portal
Publication:702730
DOI10.1023/B:ANOR.0000039522.58036.68zbMath1066.90069OpenAlexW1967959018MaRDI QIDQ702730
Publication date: 17 January 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000039522.58036.68
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
On characterization of maximal independent sets via quadratic optimization, Problems of discrete optimization: challenges and main approaches to solve them, Metaheuristic Algorithms, QUBO Software, Building an iterative heuristic solver for a quantum annealer, Probabilistic GRASP-tabu search algorithms for the UBQP problem, Model-based approaches to multi-attribute diverse matching, Bi-objective optimization of biclustering with binary data, Diversification-driven tabu search for unconstrained binary quadratic problems, A hybrid metaheuristic approach to solving the UBQP problem, Expansion-based hill-climbing, The unconstrained binary quadratic programming problem: a survey, Partial neighborhood local searches, Constructing uniform designs: A heuristic integer programming method, Garden optimization problems for benchmarking quantum annealers, Restart strategies in optimization: parallel and serial cases, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, A column generation approach for the unconstrained binary quadratic programming problem, A new modeling and solution approach for the set-partitioning problem, An improved linearization strategy for zero-one quadratic programming problems, Solving a class of feature selection problems via fractional 0--1 programming, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Multi-start approach for an integer determinant maximization problem, Restart strategies for GRASP with path-relinking heuristics, Path relinking for unconstrained binary quadratic programming, Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem, A tight lower bound for a special case of quadratic 0-1 programming, Global optimality conditions for quadratic \(0-1\) optimization problems, A logarithmic descent direction algorithm for the quadratic knapsack problem, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Mapping a logical representation of TSP to quantum annealing, Speeding up a memetic algorithm for the max-bisection problem
Uses Software
