HAL (France)open access
A variable neighborhood search approach for cyclic bandwidth sum problem
Cyclic bandwidth sum, 0, Graph layout problem, Combinatorial optimization, Variable Neighborhood search, Greedy algorithm
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 243775
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.