{"paper":{"title":"Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abraham P. Punnen, Ante \\'Custi\\'c","submitted_at":"2015-12-09T01:00:47Z","abstract_excerpt":"In this paper we study the complexity and domination analysis in the context of the \\emph{bipartite quadratic assignment problem}. Two variants of the problem, denoted by BQAP1 and BQAP2, are investigated. A formula for calculating the average objective function value $\\mathcal{A}$ of all solutions is presented whereas computing the median objective function value is shown to be NP-hard. We show that any heuristic algorithm that produces a solution with objective function value at most $\\mathcal{A}$ has the domination ratio at least $\\frac{1}{mn}$. Analogous results for the standard \\emph{quad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02709","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}