Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
From MaRDI portal
Publication:3386794
DOI10.1287/ijoc.2019.0893OpenAlexW3001314881WikidataQ126292677 ScholiaQ126292677MaRDI QIDQ3386794
Ante Ćustić, Abraham P. Punnen, Binay K. Bhattacharya, Vladyslav Sokol
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.07057
heuristicslocal searchvariable neighborhood searchexponential neighborhoodsdomination analysisaverage solution valuenonlinear assignment problems
Approximation methods and heuristics in mathematical programming (90C59) Mathematical programming (90Cxx)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The bipartite quadratic assignment problem and extensions
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- A survey of very large-scale neighborhood search techniques
- A probabilistic heuristic for a computationally difficult set covering problem
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Arrays of distinct representatives --- a very simple NP-complete problem
- On the quality of local search for the quadratic assignment problem
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Variable neighborhood search: basics and variants
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
- Semi-greedy heuristics: An empirical study
- Complexity of a 3-dimensional assignment problem
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- P-Complete Approximation Problems
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Letter to the Editor—The Multidimensional Assignment Problem
