Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem

DOI10.1016/j.cor.2014.05.019zbMath1348.90514OpenAlexW2124874953MaRDI QIDQ337120

Jesús Sánchez-Oro, Rafael Martí, Abraham Duarte, Manuel Laguna

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.019

zbMATH Keywords

quadratic programmingtabu searchbranch and boundheuristic searchiterated local search

Mathematics Subject Classification ID

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

Related Items

Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, The Bipartite QUBO, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, The bipartite quadratic assignment problem and extensions, The bipartite Boolean quadric polytope, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms, Markov chain methods for the bipartite Boolean quadratic programming problem, The generalized vertex cover problem and some variations, Combinatorial optimization with interaction costs: complexity and solvable cases, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Branch and bound for the cutwidth minimization problem
• Hybrid scatter tabu search for unconstrained global optimization
• A study of diversification strategies for the quadratic assignment problem
• Greedy randomized adaptive search procedures
• Semi-greedy heuristics: An empirical study
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
• A branch and bound algorithm for the maximum diversity problem
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
• Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
• Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
• An Automatic Method of Solving Discrete Programming Problems
• Heuristic analysis, linear programming and branch and bound
• Approximating the Cut-Norm via Grothendieck's Inequality