The Bipartite QUBO
From MaRDI portal
Publication:5050150
DOI10.1007/978-3-031-04520-2_10OpenAlexW4285032760MaRDI QIDQ5050150
Publication date: 15 November 2022
Published in: The Quadratic Unconstrained Binary Optimization Problem (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-04520-2_10
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Uses Software
Cites Work
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- A survey of very large-scale neighborhood search techniques
- Nuclear norm minimization for the planted clique and biclique problems
- A continuous characterization of the maximum-edge biclique problem
- Maximum weighted edge biclique problem on bipartite graphs
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
- Quick approximation to matrices and applications
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Differential approximation algorithms for some combinatorial optimization problems
- Easy and difficult objective functions for max cut
- The maximum edge biclique problem is NP-complete
- TSP heuristics: domination analysis and complexity
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Finding maximum edge bicliques in convex bipartite graphs
- Extended neighborhood: Definition and characterization
- Semi-greedy heuristics: An empirical study
- A simple recipe for concise mixed 0-1 linearizations
- A new polynomially solvable class of quadratic optimization problems with box constraints
- Less is more: tabu search for Bipartite Qudratic Programming problem
- Path relinking for unconstrained binary quadratic programming
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- On independent sets and bicliques in graphs
- On linear multiplicative programming.
- Continuous quadratic programming formulations of optimization problems on graphs
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Scale reduction techniques for computing maximum induced bicliques
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis
- The bipartite Boolean quadric polytope
- On Bipartite and Multipartite Clique Problems
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Grothendieck-Type Inequalities in Combinatorial Optimization
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- Approximating the cut-norm via Grothendieck's inequality
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Maximization of A convex quadratic function under linear constraints
- The Algorithmic Aspects of the Regularity Lemma
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- A Decomposition Method for Quadratic Zero-One Programming
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Approximating the Cut-Norm via Grothendieck's Inequality
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Bipartite QUBO
