Lower bounding techniques for frequency assignment
- 28 February 1999
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 197-198, 41-52
- https://doi.org/10.1016/s0012-365x(99)90037-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Improving heuristics for the frequency assignment problemEuropean Journal of Operational Research, 1998
- FASoft: A system for discrete channel frequency assignmentRadio Science, 1997
- Bounds for the frequency assignment problemDiscrete Mathematics, 1997
- A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected GraphINFORMS Journal on Computing, 1994
- On the use of some known methods forT-colorings of graphsAnnals of Operations Research, 1993
- Symmetric traveling salesman problemsEuropean Journal of Operational Research, 1990
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxationEuropean Journal of Operational Research, 1982
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957