Finding linear and circular sequences of minimal and maximal total adjacency

DOI10.1016/0020-0190(80)90113-1MaRDI QIDQ1137873zbMATH OpenOpenAlexFDO

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

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

circular sequencescomputer aided geometric designlinear sequencesquadratic assignment problemtotal adjacency

Mathematics Subject Classification ID

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

Cites work

• A Review of the Placement and Quadratic Assignment Problems
• Assignment Problems and the Location of Economic Activities
• scientific article; zbMATH DE number 3523322 (Why is no real title available?)
• scientific article; zbMATH DE number 3610692 (Why is no real title available?)
• scientific article; zbMATH DE number 3626631 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Tree-search algorithms for quadratic assignment problems

Describes a project that uses

Uses Software

• ALGOL 68

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

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