Adaptive memory tabu search for binary quadratic programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1488074
- scientific article; zbMATH DE number 1054674
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Adaptive memory search for Boolean optimization problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
Cited in
(60)- On the benefits of a new continuous reformulation for QUBO problems
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A column generation approach for the unconstrained binary quadratic programming problem
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- An Updated Experimental Evaluation of Graph Bipartization Methods
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Strategic oscillation for the quadratic multiple knapsack problem
- A linearization framework for unconstrained quadratic (0-1) problems
- QUBO software
- The unconstrained binary quadratic programming problem: a survey
- Leveraging special-purpose hardware for local search heuristics
- The bipartite QUBO
- A tight lower bound for a special case of quadratic 0-1 programming
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- scientific article; zbMATH DE number 2209664 (Why is no real title available?)
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- A class of spectral bounds for max \(k\)-cut
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Metaheuristic algorithms
- The bipartite quadratic assignment problem and extensions
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Solving group technology problems via clique partitioning
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- A hybrid metaheuristic approach to solving the UBQP problem
- Path relinking for unconstrained binary quadratic programming
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A new modeling and solution approach for the set-partitioning problem
- A quadratic simplex algorithm for primal optimization over zero-one polytopes
- An entropy-regularized ADMM for binary quadratic programming
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Adaptive memory search for Boolean optimization problems
- Faster exact solution of sparse maxcut and QUBO problems
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- New approach to solve unconstrained binary quadratic problem
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
- Bounds for random binary quadratic programs
- Building an iterative heuristic solver for a quantum annealer
- An effective modeling and solution approach for the generalized independent set problem
- A new approach for modeling and solving set packing problems
- An evolutionary heuristic for quadratic 0-1 programming
- Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems
- ``Miniaturized linearizations for quadratic 0/1 problems
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Iterated local search, iterated greedy and applications
This page was built for publication: Adaptive memory tabu search for binary quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783926)
