Bilinear assignment problem : large neighborhoods and experimental analysis of algorithms
Year of publication: |
2020
|
---|---|
Authors: | Sokol, Vladyslav ; Ćustić, Ante ; Punnen, Abraham P. ; Bhattacharya, Binay |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 3, p. 730-746
|
Subject: | nonlinear assignment problems | average solution value | domination analysis | heuristics | local search | exponential neighborhoods | variable neighborhood search | Nachbarschaft | Neighbourhood | Heuristik | Heuristics | Algorithmus | Algorithm | Wohnstandort | Residential location | Experiment | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
Lai, Xiangjing, (2021)
-
The multimode covering location problem
Colombo, Fabio, (2016)
-
MaxMinMin p-dispersion problem : a variable neighborhood search approach
Saboonchi, Behnaz, (2014)
- More ...
-
Ćustić, Ante, (2017)
-
Experimental analysis of algorithms for the independent quadratic assignment problem
Yang, Wei, (2024)
-
On Computing the Optimal Bridge between Two Convex Polygons
Bhattacharya, Binay, (2018)
- More ...