Probabilistic GRASP-tabu search algorithms for the UBQP problem
From MaRDI portal
Recommendations
- A hybrid metaheuristic approach to solving the UBQP problem
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Path relinking for unconstrained binary quadratic programming
- The unconstrained binary quadratic programming problem: a survey
- Iterated tabu search for the unconstrained binary quadratic optimization problem
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Decomposition Method for Quadratic Zero-One Programming
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A hybrid metaheuristic approach to solving the UBQP problem
- A unified modeling and solution framework for combinatorial optimization problems
- Adaptive memory tabu search for binary quadratic programs
- Advanced scatter search for the max-cut problem
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An evolutionary heuristic for quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Iterated tabu search for the unconstrained binary quadratic optimization problem
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Obtaining test problems via Internet
- On the notion of balance of a signed graph
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Randomized heuristics for the Max-Cut problem
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Solving the maxcut problem by the global equilibrium search
- Tabu Search—Part I
Cited in
(20)- \(f\)-flip strategies for unconstrained binary quadratic programming
- The unconstrained binary quadratic programming problem: a survey
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
- Exact and heuristic solution approaches for the generalized independent set problem
- Adaptive randomization in network data
- Building an iterative heuristic solver for a quantum annealer
- Metaheuristic algorithms
- The generalized independent set problem: polyhedral analysis and solution approaches
- An effective iterated tabu search for the maximum bisection problem
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A multiple search operator heuristic for the max-k-cut problem
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- Path relinking for unconstrained binary quadratic programming
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- Memetic search for the max-bisection problem
- The directed profitable rural postman problem with incompatibility constraints
- Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
This page was built for publication: Probabilistic GRASP-tabu search algorithms for the UBQP problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336712)
