Showing math.OCShow all
2 papers · 1 filter
math.OC2022
The Largest Unsolved QAP Instance Tai256c Can Be Converted into A 256-dimensional Simple BQOP with A Single Cardinality Constraint
Koichi Fujii, Sunyoung Kim, Masakazu Kojima +2
Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB; a 1.48\% gap remains between the best known feasible objective value and lower bound of the u…
math.OC2017
Polynomial-Time Methods to Solve Unimodular Quadratic Programs With Performance Guarantees
Shankarachary Ragi, Edwin K. P. Chong, Hans D. Mittelmann
We develop polynomial-time heuristic methods to solve unimodular quadratic programs (UQPs) approximately, which are known to be NP-hard. In the UQP framework, we maximize a quadrat…