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

Local search algorithms for the min-max loop layout problem

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

DOI10.1057/palgrave.jors.2601269zbMath1136.90527OpenAlexW1970981728MaRDI QIDQ4656728

Chris N. Potts, J. D. Whitehead, Julia A. Bennell

Publication date: 14 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601269

zbMATH Keywords

tabu searchlocal searchinsertion algorithmloop layoutiterated descent


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items

Exact solution procedures for the balanced unidirectional cyclic layout problem



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