Domination analysis of algorithms for bipartite Boolean quadratic programs

DOI10.1007/978-3-642-40164-0_26MaRDI QIDQ2842791zbMATH OpenOpenAlexFDO

Authors 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

Boolean variablesdomination analysisquadratic programmingworst-case analysis

Mathematics Subject Classification ID

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

Recommendations

• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
• Markov chain methods for the bipartite Boolean quadratic programming problem
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs

Cited in

(6)

• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
• Markov chain methods for the bipartite Boolean quadratic programming problem
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
• The bipartite quadratic assignment problem and extensions
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints

This page was built for publication: Domination analysis of algorithms for bipartite Boolean quadratic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842791)