A study of permutation operators for minimum span frequency assignment using an order based representation
From MaRDI portal
Publication:5933514
DOI10.1023/A:1026597127504zbMath0967.90075OpenAlexW1485400391MaRDI QIDQ5933514
Publication date: 3 September 2001
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026597127504
greedy algorithmgenetic algorithmminimum span frequency assignmentorder based operatorspermutation operators
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
Algorithms for the generalized weighted frequency assignment problem ⋮ An investigation into two bin packing problems with ordering and orientation implications ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
Uses Software
This page was built for publication: A study of permutation operators for minimum span frequency assignment using an order based representation
