A linear formulation with O(n2) variables for quadratic assignment problems with Manhattan distance matrices
Year of publication: |
2015
|
---|---|
Authors: | Gueye, Serigne ; Michelon, Philippe |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 3.2015, 2, p. 79-110
|
Subject: | Quadratic assignment problem | Distance | Integer programming | Cutting planes | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Theorie | Theory | Geographische Entfernung | Geographic distance | Betriebliche Standortwahl | Firm location choice |
-
A fast algorithm for the rectilinear distance location problem
Nobakhtian, S., (2018)
-
Nonrobust strong knapsack cuts for capacitated location routing and related problems
Liguori, Pedro Henrique, (2023)
-
A column generation heuristics for congested facility location problem with clearing functions
Kim, S., (2013)
- More ...
-
Acuna-Agost, Rodrigo, (2011)
-
A hybrid metaheuristic for the minimum labeling spanning tree problem
Silva, Thiago Gouveia da, (2019)
-
A polyhedral approach to the generalized minimum labeling spanning tree problem
Silva, Thiago Gouveia da, (2019)
- More ...