Test Problem Generator for the Multidimensional Assignment Problem

Authors:
Don A. Grundel;Panos M. Pardalos
Affiliations:
Aff1 Aff3;Aff1 Aff4
Venue:
Computational Optimization and Applications
Year:
2005

Citing 6
Cited 5

An algorithm for the three-index assignment problem

Operations Research
Three-dimensional axial assignment problems with decomposable cost coefficients

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Selected topics on assignment problems

Discrete Applied Mathematics
Nonlinear Assignment Problems: Algorithms and Applications (Combinatorial Optimization)

Nonlinear Assignment Problems: Algorithms and Applications (Combinatorial Optimization)

Local Search Heuristics for the Multidimensional Assignment Problem

Graph Theory, Computational Intelligence and Thought
Hybrid metaheuristic combining ant colony optimization and H-method

ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Local search heuristics for the multidimensional assignment problem

Journal of Heuristics
A new approach to population sizing for memetic algorithms: A case study for the multidimensional assignment problem

Evolutionary Computation
Solving the Multidimensional Assignment Problem by a Cross-Entropy method

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multidimensional assignment problem (MAPs) is a higher dimensional version of the standard linear assignment problem. Test problems of known solution are useful in exercising solution methods. A method of generating an axial MAP of controllable size with a known unique solution is presented. Certain characteristics of the generated MAPs that determine realism and difficulty are investigated.