Finding linear and circular sequences of minimal and maximal total adjacency

DOI10.1016/0020-0190(80)90113-1zbMath0429.68063OpenAlexW1980434953MaRDI QIDQ1137873

R. N. Rolph, V. J. Rayward-Smith

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90113-1

zbMATH Keywords

quadratic assignment problemlinear sequencescomputer aided geometric designcircular sequencestotal adjacency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Uses Software

• ALGOL 68

Cites Work

• Assignment Problems and the Location of Economic Activities
• Tree-search algorithms for quadratic assignment problems
• A Review of the Placement and Quadratic Assignment Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding linear and circular sequences of minimal and maximal total adjacency