scientific article; zbMATH DE number 5063027
From MaRDI portal
Publication:5491984
zbMath1098.90048MaRDI QIDQ5491984
Publication date: 12 October 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Metaheuristic Algorithms ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Probabilistic GRASP-tabu search algorithms for the UBQP problem ⋮ Diversification-driven tabu search for unconstrained binary quadratic problems ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ A branch-and-bound algorithm for the minimum cut linear arrangement problem ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ Algorithm unions for solving discrete optimization problems ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ A branch-and-bound algorithm for the single-row equidistant facility layout problem ⋮ Solving unconstrained binary quadratic programming problem by global equilibrium search ⋮ Path relinking for unconstrained binary quadratic programming ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
This page was built for publication:
