Tabu search for the planar three-index assignment problem

DOI10.1007/BF00229300MaRDI QIDQ1923786zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 13 October 1996

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00229300

zbMATH Keywords

Latin squarestabu searchmove generation mechanismplanar three-index assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• An algorithm for the planar three-index assignment problem
• Tabu Search Applied to the Quadratic Assignment Problem
• Tabu Search—Part I
• A hybrid genetic algorithm for the three-index assignment problem
• Investigation of polynomial algorithms for solving the three-index planar assignment problem

Cited in

(10)

• On the orthogonal Latin squares polytope
• A reduction approach to the repeated assignment problem
• Scheduling sports competitions on multiple venues.
• Selected topics on assignment problems
• A heuristic method for solving integer-valued decompositional multiindex problems
• A survey for the quadratic assignment problem
• Round robin tournaments and three index assignments
• Combining solutions of the axial assignment problem
• A tabu search algorithm for the global planning problem of third generation mobile networks
• A characterization of odd-hole inequalities related to Latin squares

This page was built for publication: Tabu search for the planar three-index assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923786)