We present a compact linearization for a broad class of bilinear 0-1 mixed-integer problems subject to assignment constraints. We apply the linearization to three classes of problems: quadratic assignment, multiprocessor scheduling with communication delays, and graph partitioning, and show that it yields faster solution times.
Citation
DEI, Politecnico di Milano, Working paper, April 2005.
Article
View Compact linearization for bilinear mixed-integer problems