Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs

DOI10.1007/978-3-642-40164-0_26zbMath1391.90416OpenAlexW45240301MaRDI QIDQ2842791

Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40164-0_26

zbMATH Keywords

quadratic programmingworst-case analysisBoolean variablesdomination analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

The bipartite quadratic assignment problem and extensions ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms ⋮ The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

This page was built for publication: Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs