Generation of lower bounds for minimum span frequency assignment

DOI10.1016/S0166-218X(01)00265-7zbMath1102.90372OpenAlexW2106584680WikidataQ126982390 ScholiaQ126982390MaRDI QIDQ1602703

R. Smith

Publication date: 24 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00265-7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (2)

Price of anarchy for graph coloring games with concave payoff ⋮ Polyhedral studies for minimum‐span graph labelling with integer distance constraints

Uses Software

• FASoft

Cites Work

• Unnamed Item
• An exact algorithm for the maximum clique problem
• Lower bounding techniques for frequency assignment
• Improving heuristics for the frequency assignment problem
• Bounds for the frequency assignment problem
• A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph

This page was built for publication: Generation of lower bounds for minimum span frequency assignment