The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
From MaRDI portal
Publication:2355744
DOI10.1016/j.dam.2015.04.004zbMath1333.90077arXiv1212.3736MaRDI QIDQ2355744
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
Publication date: 24 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.3736
Related Items
The Bipartite QUBO, The Rank-One Quadratic Assignment Problem, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Shortest Paths in Graphs of Convex Sets, The bipartite quadratic assignment problem and extensions, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms, 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, Combinatorial optimization with interaction costs: complexity and solvable cases, Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, The bipartite Boolean quadric polytope, Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- A hybrid metaheuristic approach to solving the UBQP problem
- Pseudo-Boolean optimization
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- Minimum perfect bipartite matchings and spanning trees under categorization
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- On \(k\)-sum optimization
- Path relinking for unconstrained binary quadratic programming
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Polynomially Solvable Cases of Binary Quadratic Programs
- Maximizing the Product of Two Linear Functions In 0-1 Variables
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- Minimum cuts and related problems
- Maximization of A convex quadratic function under linear constraints
- Efficient Computation of the Binary Vector That Maximizes a Rank-Deficient Quadratic Form
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Approximating the Cut-Norm via Grothendieck's Inequality
- A Selection Problem of Shared Fixed Costs and Network Flows
- A polynomial case of unconstrained zero-one quadratic optimization
