The Bipartite QUBO (Q5050150)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7616618

Language	Label	Description	Also known as
English	The Bipartite QUBO	scientific article; zbMATH DE number 7616618

Statements

scholarly article

0 references

The Bipartite QUBO (English)

0 references

Abraham P. Punnen

0 references

The Quadratic Unconstrained Binary Optimization Problem

0 references

publication date

15 November 2022

0 references

zbMATH Keywords

computational complexity

0 references

MILP formulations

0 references

exact and heuristic algorithms

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-04520-2_10

0 references

A simple recipe for concise mixed 0-1 linearizations

0 references

A survey of very large-scale neighborhood search techniques

0 references

Approximating the cut-norm via Grothendieck's inequality

0 references

Approximating the Cut-Norm via Grothendieck's Inequality

0 references

The Algorithmic Aspects of the Regularity Lemma

0 references

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

0 references

Nuclear norm minimization for the planted clique and biclique problems

0 references

Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem

0 references

The Grothendieck Constant is Strictly Smaller than Krivine's Bound

0 references

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

0 references

A Decomposition Method for Quadratic Zero-One Programming

0 references

On Bipartite and Multipartite Clique Problems

0 references

Differential approximation algorithms for some combinatorial optimization problems

0 references

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

0 references

0 references

Quick approximation to matrices and applications

0 references

On independent sets and bicliques in graphs

0 references

Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard

0 references

A continuous characterization of the maximum-edge biclique problem

0 references

Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

0 references

Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems

0 references

Adaptive Memory Tabu Search for Binary Quadratic Programs

0 references

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems

0 references

Diversification-driven tabu search for unconstrained binary quadratic problems

0 references

The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms

0 references

Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs

0 references

0 references

0 references

Continuous quadratic programming formulations of optimization problems on graphs

0 references

0 references

Semi-greedy heuristics: An empirical study

0 references

A new polynomially solvable class of quadratic optimization problems with box constraints

0 references

Markov chain methods for the bipartite Boolean quadratic programming problem

0 references

Grothendieck-Type Inequalities in Combinatorial Optimization

0 references

Maximization of A convex quadratic function under linear constraints

0 references

MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE

0 references

Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial

0 references

Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis

0 references

0 references

A hybrid metaheuristic approach to solving the UBQP problem

0 references

Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis

0 references

Easy and difficult objective functions for max cut

0 references

0 references

Finding maximum edge bicliques in convex bipartite graphs

0 references

Extended neighborhood: Definition and characterization

0 references

0 references

Maximum weighted edge biclique problem on bipartite graphs

0 references

The maximum edge biclique problem is NP-complete

0 references

TSP heuristics: domination analysis and complexity

0 references

On linear multiplicative programming.

0 references

Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms

0 references

The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

0 references

Scale reduction techniques for computing maximum induced bicliques

0 references

The bipartite Boolean quadric polytope

0 references

Inapproximability of Maximum Weighted Edge Biclique and Its Applications

0 references

Less is more: tabu search for Bipartite Qudratic Programming problem

0 references

Path relinking for unconstrained binary quadratic programming

0 references

Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking

0 references

Measuring the Quality of Approximate Solutions to Zero-One Programming Problems

0 references

Identifiers

10.1007/978-3-031-04520-2_10

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5050150

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5050150&oldid=37457583"