A branch-and-cut algorithm for quadratic assignment problems based on linearizations

From MaRDI portal

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_branch-and-cut_algorithm_for_quadratic_assignment_problems_based_on_linearizations&oldid=64858689"