Adaptive Memory Tabu Search for Binary Quadratic Programs
From MaRDI portal
Publication:2783926
DOI10.1287/mnsc.44.3.336zbMath0989.90072OpenAlexW2115910554MaRDI QIDQ2783926
Gary A. Kochenberger, Bahram Alidaee, Fred Glover
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3aba5d8a3b309584f18ca814a0d3498dad7a5144
Nonlinear programming (90C30) Linear programming (90C05) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Leveraging special-purpose hardware for local search heuristics, Metaheuristic Algorithms, The Bipartite QUBO, QUBO Software, Building an iterative heuristic solver for a quantum annealer, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, The bipartite quadratic assignment problem and extensions, Probabilistic GRASP-tabu search algorithms for the UBQP problem, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, Solving the maximum edge weight clique problem via unconstrained quadratic programming, Solving group technology problems via clique partitioning, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, Diversification-driven tabu search for unconstrained binary quadratic problems, A class of spectral bounds for max \(k\)-cut, Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems, A hybrid metaheuristic approach to solving the UBQP problem, An Updated Experimental Evaluation of Graph Bipartization Methods, The unconstrained binary quadratic programming problem: a survey, An entropy-regularized ADMM for binary quadratic programming, Faster exact solution of sparse maxcut and QUBO problems, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, A quadratic simplex algorithm for primal optimization over zero-one polytopes, A column generation approach for the unconstrained binary quadratic programming problem, Bounds for Random Binary Quadratic Programs, Solving unconstrained binary quadratic programming problem by global equilibrium search, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, Strategic oscillation for the quadratic multiple knapsack problem, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms, A new modeling and solution approach for the set-partitioning problem, An effective modeling and solution approach for the generalized independent set problem, A new approach for modeling and solving set packing problems, 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, Path relinking for unconstrained binary quadratic programming, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem, Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem, Using \(xQx\) to model and solve the uncapacitated task allocation problem, A tight lower bound for a special case of quadratic 0-1 programming, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, An evolutionary heuristic for quadratic 0-1 programming, Lagrangean decompositions for the unconstrained binary quadratic programming problem, A linearization framework for unconstrained quadratic (0-1) problems, A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, One-pass heuristics for large-scale unconstrained binary quadratic problems, An unconstrained quadratic binary programming approach to the vertex coloring problem, ``Miniaturized linearizations for quadratic 0/1 problems
