\(f\)-flip strategies for unconstrained binary quadratic programming

DOI10.1007/s10479-015-2076-1zbMath1334.90074OpenAlexW2289954911MaRDI QIDQ271994

Jin-Kao Hao, Fred Glover

Publication date: 20 April 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-2076-1

zbMATH Keywords

metaheuristicscomputational efficiencymulti-start algorithms0-1 optimizationbinary quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Uses Software

• Scatter Search

Cites Work

• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• The unconstrained binary quadratic programming problem: a survey
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• A unified modeling and solution framework for combinatorial optimization problems
• Path relinking for unconstrained binary quadratic programming
• A new modeling and solution approach for the set-partitioning problem
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Quadratic knapsack problems
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• A Decomposition Method for Quadratic Zero-One Programming
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item