Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
DOI10.1016/J.COR.2014.05.019zbMATH Open1348.90514OpenAlexW2124874953MaRDI QIDQ337120FDOQ337120
Authors: Abraham Duarte, Manuel Laguna, Rafael Martí, Jesús Sánchez-Oro 
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
Recommendations
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Less is more: tabu search for Bipartite Qudratic Programming problem
- The bipartite QUBO
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- The unconstrained binary quadratic programming problem: a survey
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- An Automatic Method of Solving Discrete Programming Problems
- Title not available (Why is that?)
- Approximating the Cut-Norm via Grothendieck's Inequality
- Greedy randomized adaptive search procedures
- Semi-greedy heuristics: An empirical study
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Branch and bound for the cutwidth minimization problem
- A study of diversification strategies for the quadratic assignment problem
- A branch and bound algorithm for the maximum diversity problem
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Low-rank matrix approximation with weights or missing data is NP-hard
- Heuristic analysis, linear programming and branch and bound
- Hybrid scatter tabu search for unconstrained global optimization
Cited In (13)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- The bipartite Boolean quadric polytope
- The bipartite QUBO
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- Markov chain methods for the bipartite Boolean quadratic programming problem
- The generalized vertex cover problem and some variations
- The bipartite quadratic assignment problem and extensions
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Less is more: tabu search for Bipartite Qudratic Programming problem
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Uses Software
This page was built for publication: Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337120)
