Metaheuristic algorithms
From MaRDI portal
Recommendations
- Mathematical programming models and exact algorithms
- A survey of meta-heuristic solution methods for the quadratic assignment problem
- scientific article; zbMATH DE number 1054925
- A hybrid metaheuristic approach to solving the UBQP problem
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
Cites work
- A Spectral Bundle Method for Semidefinite Programming
- A hybrid metaheuristic approach to solving the UBQP problem
- Adaptive memory tabu search for binary quadratic programs
- An evolutionary heuristic for quadratic 0-1 programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Iterated tabu search for the unconstrained binary quadratic optimization problem
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Obtaining test problems via Internet
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Path relinking for unconstrained binary quadratic programming
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- Variable Neighborhood Search
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Cited in
(4)
This page was built for publication: Metaheuristic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050149)
