Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Tabu search for the planar three-index assignment problem

From MaRDI portal
Publication:1923786
Jump to:navigation, search

DOI10.1007/BF00229300zbMath0857.90106OpenAlexW2065836577MaRDI QIDQ1923786

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)


Related Items

On the orthogonal Latin squares polytope ⋮ A survey for the quadratic assignment problem ⋮ Round robin tournaments and three index assignments ⋮ A reduction approach to the repeated assignment problem ⋮ Selected topics on assignment problems ⋮ A heuristic method for solving integer-valued decompositional multiindex problems ⋮ Combining solutions of the axial assignment problem ⋮ Scheduling sports competitions on multiple venues. ⋮ 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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1923786&oldid=14346429"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki