Local search heuristics for the multidimensional assignment problem
type: Item
instance of: scholarly article
title: Local search heuristics for the multidimensional assignment problem
zbMATH Open document ID: 1214.90078
author: Daniel Karapetyan
author: G. Gutin
published in: Journal of Heuristics
publication date: 2011-06-16T00:00:00Z
full work available at URL: 0806.3258v6.pdf
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5908368
zbMATH Keywords: multidimensional assignment problem
zbMATH Keywords: local search
zbMATH Keywords: neighborhood
zbMATH Keywords: metaheuristics
MaRDI profile type: Publication
OpenAlex ID: W3103502041
cites work: GRASP with path relinking for three-index assignment
cites work: Solving the multisensor data association problem.
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: Local search heuristics for multi-index assignment problems with decomposable costs
cites work: Experimental and Efficient Algorithms
cites work: Q3145800
cites work: Perspectives of Monge properties in optimization
cites work: Three-dimensional axial assignment problems with decomposable cost coefficients
cites work: APPLYING SIMULATED ANNEALING TO THE MULTIDIMENSIONAL ASSIGNMENT PROBLEM
cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities
cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
cites work: Q4198056
cites work: Test problem generator for the multidimensional assignment problem
cites work: Asymptotic properties of random multidimensional assignment problems
cites work: Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
cites work: Q3508462
cites work: A hybrid genetic algorithm for the three-index assignment problem
cites work: Q3084797
cites work: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
cites work: Q5519710
cites work: An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
cites work: Q4395333
cites work: Randomized parallel algorithms for the multidimensional assignment problem
cites work: Q4762522
cites work: Branch and bound algorithms for the multidimensional assignment problem
cites work: Letter to the Editor—The Multidimensional Assignment Problem
cites work: Tracking elementary particles near their primary vertex: A combinatorial approach
cites work: Experimental evaluation of heuristic optimization algorithms: A tutorial
cites work: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
cites work: Q4801573
cites work: Geometric three-dimensional assignment problems
cites work: Q5191184
cites work: Establishing motion correspondence using extended temporal scope
DOI: 10.1007/S10732-010-9133-3
Recommended article: Local Search Heuristics for the Multidimensional Assignment Problem
Recommended article: Local search heuristics for multi-index assignment problems with decomposable costs
Recommended article: Q3002967
Recommended article: Q3367576
Recommended article: On the number of local minima for the multidimensional assignment problem
Recommended article: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
Recommended article: Very large-scale neighborhood search for the multidimensional assignment problem
Recommended article: Q4209440
Recommended article: Un algoritmo misto per il problema dell'assegnazione pluridimensionale
description: scientific article; zbMATH DE number 5908368