Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
From MaRDI portal
Recommendations
- Iterated tabu search for the unconstrained binary quadratic optimization problem
- scientific article; zbMATH DE number 1488074
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
- Tabu Search—Part II
Cited in
(40)- Adaptive memory tabu search for binary quadratic programs
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- A logarithmic descent direction algorithm for the quadratic knapsack problem
- Battleship, tomography and quantum annealing
- Iterated tabu search for the unconstrained binary quadratic optimization problem
- On characterization of maximal independent sets via quadratic optimization
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
- The unconstrained binary quadratic programming problem: a survey
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Constructing uniform designs: A heuristic integer programming method
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Building an iterative heuristic solver for a quantum annealer
- Multi-start approach for an integer determinant maximization problem
- Metaheuristic algorithms
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Problems of discrete optimization: challenges and main approaches to solve them
- A tight lower bound for a special case of quadratic 0-1 programming
- A column generation approach for the unconstrained binary quadratic programming problem
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Garden optimization problems for benchmarking quantum annealers
- A new modeling and solution approach for the set-partitioning problem
- Speeding up a memetic algorithm for the max-bisection problem
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Solving a class of feature selection problems via fractional 0--1 programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Restart strategies in optimization: parallel and serial cases
- Partial neighborhood local searches
- Mapping a logical representation of TSP to quantum annealing
- A hybrid metaheuristic approach to solving the UBQP problem
- Path relinking for unconstrained binary quadratic programming
- QUBO software
- Restart strategies for GRASP with path-relinking heuristics
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
- An improved linearization strategy for zero-one quadratic programming problems
- Model-based approaches to multi-attribute diverse matching
- Bi-objective optimization of biclustering with binary data
- Expansion-based hill-climbing
This page was built for publication: Multistart tabu search strategies 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 Q702730)
