Greedy and local search heuristics for unconstrained binary quadratic programming
From MaRDI portal
Publication:1850977
DOI10.1023/A:1017912624016zbMath1013.90100OpenAlexW1636965069MaRDI QIDQ1850977
Publication date: 15 December 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017912624016
Quadratic programming (90C20) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (24)
Problems of discrete optimization: challenges and main approaches to solve them ⋮ Fast Heuristics and Approximation Algorithms ⋮ Metaheuristic Algorithms ⋮ Modeling and heuristics for production time crashing in supply chain network design ⋮ Diversification-driven tabu search for unconstrained binary quadratic problems ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Constructing uniform designs: A heuristic integer programming method ⋮ A quadratic simplex algorithm for primal optimization over zero-one polytopes ⋮ A variable depth search branching ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations ⋮ Quadratic reformulations of nonlinear binary optimization problems ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ An effective genetic algorithm approach to large scale mixed integer programming problems ⋮ Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem ⋮ A variable-grouping based genetic algorithm for large-scale integer programming ⋮ Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes ⋮ A linearization framework for unconstrained quadratic (0-1) problems ⋮ An effective local search for the maximum clique problem ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem ⋮ ``Miniaturized linearizations for quadratic 0/1 problems
Uses Software
This page was built for publication: Greedy and local search heuristics for unconstrained binary quadratic programming
