On the public citation graph
A tabu search algorithm for frequency assignment
0 signed · 113 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01471219openalex-snapshot
Tabu search methods for a single machine scheduling problem
inferredcites →https://doi.org/10.1007/bf01720977openalex-snapshot
Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches
inferredcites →https://doi.org/10.1007/bf02022999openalex-snapshot
Massively parallel tabu search for the quadratic assignment problem
inferredcites →https://doi.org/10.1007/bf02023000openalex-snapshot
On the use of some known methods forT-colorings of graphs
inferredcites →https://doi.org/10.1007/bf02023004openalex-snapshot
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
inferredcites →https://doi.org/10.1007/bf02023006openalex-snapshot
Solving real-life vehicle routing problems efficiently using tabu search
inferredcites →https://doi.org/10.1007/bf02023075openalex-snapshot
A tabu-search heuristic for the flexible-resource flow shop scheduling problem
inferredcites →https://doi.org/10.1007/bf02023077openalex-snapshot
Tabu search for a class of scheduling problems
inferredcites →https://doi.org/10.1007/bf02073940openalex-snapshot
Least-cost network topology design for a new service
inferredcites →https://doi.org/10.1007/bf02110142openalex-snapshot
On minimum cost isolated failure immune networks
inferredcites →https://doi.org/10.1007/bf02125454openalex-snapshot
Diversification strategies in tabu search algorithms for the maximum clique problem
inferredcites →https://doi.org/10.1016/0166-218x(92)90004-topenalex-snapshot
Optimal multiple interval assignments in frequency assignment and traffic phasing
inferredcites →https://doi.org/10.1016/0166-218x(94)90207-0openalex-snapshot
Chromatic scheduling and frequency assignment
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0305-0548(86)90050-xopenalex-snapshot
The general employee scheduling problem. An integration of MS and AI
inferredcites →https://doi.org/10.1016/0377-2217(94)90245-3openalex-snapshot
On tabu search for the location of interacting hub facilities
inferredcites →https://doi.org/10.1016/0969-6016(94)90032-9openalex-snapshot
Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search
inferredcites →https://doi.org/10.1016/s0167-8191(05)80147-4openalex-snapshot
Robust taboo search for the quadratic assignment problem
inferredcites →https://doi.org/10.1080/01966324.1993.10737361openalex-snapshot
Algorithms for the Vehicle Routing Problems with Time Deadlines
inferredcites →https://doi.org/10.1109/25.192382openalex-snapshot
Channel assignment for cellular radio using simulated annealing
inferredcites →https://doi.org/10.1109/25.260746openalex-snapshot
Channel assignment in cellular radio networks
inferredcites →https://doi.org/10.1109/proc.1980.11899openalex-snapshot
Frequency assignment: Theory and applications
inferredcites →https://doi.org/10.1111/j.1540-5915.1977.tb01074.xopenalex-snapshot
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
inferredcites →https://doi.org/10.1287/ijoc.2.1.33openalex-snapshot
Tabu Search Applied to the Quadratic Assignment Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471224561.ch3openalex-snapshot
Heuristics for Solving Fixed‐Channel Assignment Problems
inferred← citeshttps://doi.org/10.1002/wcm.898openalex-snapshot
A survey on the channel assignment problem in wireless networks
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_273openalex-snapshot
Maximum Constraint Satisfaction: Relaxations and Upper Bounds
inferred← citeshttps://doi.org/10.1007/11890584_13openalex-snapshot
Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem
inferred← citeshttps://doi.org/10.1007/3-540-36385-8_12openalex-snapshot
On the Radiocoloring Problem
inferred← citeshttps://doi.org/10.1007/3-540-46004-7_13openalex-snapshot
An Experimental Investigation of Iterated Local Search for Coloring Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_32openalex-snapshot
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_357openalex-snapshot
Maximum Constraint Satisfaction: Relaxations and Upper Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_22openalex-snapshot
Tabu Thresholding for the Frequency Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_6openalex-snapshot
Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_6openalex-snapshot
Frequency Assignment Problems
inferred← citeshttps://doi.org/10.1007/978-3-7091-6492-1_67openalex-snapshot
Breeding Permutations for Minimum Span Frequency Assignment
inferred← citeshttps://doi.org/10.1007/978-3-7091-6492-1_69openalex-snapshot
Chaotic Neurodynamics in the Frequency Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-7091-6492-1_70openalex-snapshot
A Divide-and-Conquer Technique to Solve the Frequency Assignment Problem
inferred← citeshttps://doi.org/10.1007/s101070100247openalex-snapshot
Minimizing the span of d -walks to compute optimum frequency assignments
inferred← citeshttps://doi.org/10.1007/s10288-004-0057-3openalex-snapshot
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
inferred← citeshttps://doi.org/10.1007/s10479-007-0178-0openalex-snapshot
Models and solution techniques for frequency assignment problems
inferred← citeshttps://doi.org/10.1007/s10601-007-9023-yopenalex-snapshot
Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment
inferred← citeshttps://doi.org/10.1007/s10922-009-9152-2openalex-snapshot
An Admission Control-based Benefit Optimization Model for Mobile Communications: the Effect of a Decision Time Budget
inferred← citeshttps://doi.org/10.1007/s11235-010-9293-3openalex-snapshot
The effect of call admission policies on the system benefit of CDMA communication networks
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105797openalex-snapshot
An effective multi-objective hybrid immune algorithm for the frequency assignment problem
inferred← citeshttps://doi.org/10.1016/j.cor.2006.07.012openalex-snapshot
A column generation and branch-and-cut algorithm for the channel assignment problem
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.019openalex-snapshot
Special structures in Q(4,q) , projective planes and its application in L(h,k)− colorings of their Moore Graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.01.025openalex-snapshot
Path relinking for the fixed spectrum frequency assignment problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00257-9openalex-snapshot
Bounds for the frequency assignment problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00239-1openalex-snapshot
An enumerative algorithm for the frequency assignment problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(03)00210-7openalex-snapshot
Optimized planning of frequency hopping in cellular networks
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00127-9openalex-snapshot
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)80006-4openalex-snapshot
Improving heuristics for the frequency assignment problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00254-4openalex-snapshot
Frequency assignment in mobile radio systems using branch-and-cut techniques
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)00746-8openalex-snapshot
Solving Frequency Assignment Problems via Tree-Decomposition
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80034-4openalex-snapshot
Solving Frequency Assignment Problems via Tree-Decomposition1
inferred← citeshttps://doi.org/10.1023/a:1009690321348openalex-snapshot
Tabu Search for Frequency Assignment in Mobile Radio Networks
inferred← citeshttps://doi.org/10.1023/a:1014907300704openalex-snapshot
Channel Loading in Private Mobile Radio Networks
inferred← citeshttps://doi.org/10.1023/a:1014911401612openalex-snapshot
Lower Bounds for Fixed Spectrum Frequency Assignment
inferred← citeshttps://doi.org/10.1023/a:1018908907763openalex-snapshot
Frequency assignment in cellular phone networks
inferred← citeshttps://doi.org/10.1023/a:1018958819459openalex-snapshot
A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem
inferred← citeshttps://doi.org/10.1023/a:1020325602854openalex-snapshot
Optimising Channel Assignments for Private Mobile Radio Networks in the UHF 2 Band
inferred← citeshttps://doi.org/10.1023/a:1025964603779openalex-snapshot
Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems
inferred← citeshttps://doi.org/10.1023/b:anor.0000032575.38969.abopenalex-snapshot
Efficient Filtering and Tabu Search on a Consistent Neighbourhood for the Frequency Assignment Problem with Polarisation
inferred← citeshttps://doi.org/10.1093/comjnl/bxl018openalex-snapshot
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.1093/comjnl/bxr037openalex-snapshot
The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.1108/jsit-10-2017-0094openalex-snapshot
Breakout variable neighbourhood search for the minimum interference frequency assignment problem
inferred← citeshttps://doi.org/10.1109/18.737551openalex-snapshot
Minimization criteria for frequency planning in cellular radio systems
inferred← citeshttps://doi.org/10.1109/25.653071openalex-snapshot
A unified approach to the assignment of radio channels on a regular hexagonal grid
inferred← citeshttps://doi.org/10.1109/25.994802openalex-snapshot
Planning effective cellular mobile radio networks
inferred← citeshttps://doi.org/10.1109/4235.738972openalex-snapshot
An efficient evolutionary algorithm for channel resource management in cellular mobile systems
inferred← citeshttps://doi.org/10.1109/ccdc.2017.7978465openalex-snapshot
Carrier aircraft support resource procedure optimization based on genetic algorithm
inferred← citeshttps://doi.org/10.1109/cec.2008.4631329openalex-snapshot
A multi-objective approach to the Channel Assignment Problem
inferred← citeshttps://doi.org/10.1109/chicc.2016.7553798openalex-snapshot
An improved genetic algorithm of multiple cooperative air combat fire distribution method
inferred← citeshttps://doi.org/10.1109/coginf.2011.6016177openalex-snapshot
An Immune System for the general T-coloring problem
inferred← citeshttps://doi.org/10.1109/hicss.2002.994002openalex-snapshot
Automated decision technology for network design in cellular communication systems
inferred← citeshttps://doi.org/10.1109/hpc.2000.846542openalex-snapshot
Quasi-static dynamic channel assignment using a Linux PC cluster
inferred← citeshttps://doi.org/10.1109/icct.2011.6157863openalex-snapshot
A bi-objective multi-swarm particle swarm optimization algorithm for the frequency assignment problem
inferred← citeshttps://doi.org/10.1109/icisce50968.2020.00364openalex-snapshot
Dynamic Frequency Assignment Method on the Battlefield with Complex Interference Constraints
inferred← citeshttps://doi.org/10.1109/icnsurv.2012.6218401openalex-snapshot
Minimizing self-interference in an aeronautical data communications network
inferred← citeshttps://doi.org/10.1109/icnsurv.2014.6820013openalex-snapshot
Load-balancing algorithms for multifrequency data communications
inferred← citeshttps://doi.org/10.1109/ictai.2017.00154openalex-snapshot
Some Neighbourhood Approaches for the Antenna Positioning Problem
inferred← citeshttps://doi.org/10.1109/isfee.2016.7803202openalex-snapshot
Solving the frequency assignment problem by using meta-heuristic methods
inferred← citeshttps://doi.org/10.1109/tmc.2018.2865934openalex-snapshot
Lower Bound on Bandwidth and Channel Assignment Algorithm for Multimedia Communication in Cellular Networks
inferred← citeshttps://doi.org/10.1109/tvt.2003.810976openalex-snapshot
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem
inferred← citeshttps://doi.org/10.1109/vetecf.1999.797357openalex-snapshot
A quasi-static cluster-computing approach for dynamic channel assignment in cellular mobile communication systems
inferred← citeshttps://doi.org/10.1109/wicom.2009.5301719openalex-snapshot
A Tabu Search Algorithm for Frequency Assignment Problem in Wireless Communication Networks
inferred← citeshttps://doi.org/10.1109/wicom.2010.5601316openalex-snapshot
Research of a Dynamic Frequency Spectrum Assignment Algorithm Based on Battle Management and Control
inferred← citeshttps://doi.org/10.1109/wpmc.2002.1088253openalex-snapshot
Improving the accuracy of interference models for channel assignment
inferred← citeshttps://doi.org/10.1111/coin.12454openalex-snapshot
Evolutionary Iterated Local Search meta‐heuristic for the antenna positioning problem in cellular networks
inferred← citeshttps://doi.org/10.1145/2261605.2261676openalex-snapshot
A dynamic channel assignment in GSM telecommunication network using modified genetic algorithm
inferred← citeshttps://doi.org/10.1145/331119.331186openalex-snapshot
A comparison of local search algorithms for radio link frequency assignment problems
inferred← citeshttps://doi.org/10.1145/381448.381456openalex-snapshot
Reactive GRASP with path relinking for channel assignment in mobile phone networks
inferred← citeshttps://doi.org/10.1155/2020/5748680openalex-snapshot
Product Service Scheduling Problem with Service Matching Based on Tabu Search Method
inferred← citeshttps://doi.org/10.1201/9781315220178-1openalex-snapshot
Computational Intelligence: A Development Environment for Telecommunications Networks
inferred← citeshttps://doi.org/10.1201/ebk1420077759-c8openalex-snapshot
Quality-of-Service in Cognitive WLAN over Fiber
inferred← citeshttps://doi.org/10.1287/opre.50.6.968.353openalex-snapshot
Algorithms for Radio Link Frequency Assignment: The Calma Project
inferred← citeshttps://doi.org/10.1504/ijbic.2010.036162openalex-snapshot
Two hybrid ant algorithms for the general T-colouring problem
inferred← citeshttps://doi.org/10.2991/emcs-17.2017.3openalex-snapshot
A Certain Naval Gun on Empty Firing Command Decision Research
inferred← citeshttps://doi.org/10.2991/icmcs-18.2018.55openalex-snapshot
Optimization of Operational Application of Submarine-Launched Anti-Ship Missile to Sea Attack based on Time Effect Analysis
inferred← citeshttps://doi.org/10.2991/mcei-16.2016.88openalex-snapshot
Submarine Attacking Surface Ship Combat Based on Petri Net Modeling Method
inferred← citeshttps://doi.org/10.2991/mcei-16.2016.89openalex-snapshot
Combat Power Emerging Effect of Mathematical Model
inferred← citeshttps://doi.org/10.2991/meici-16.2016.229openalex-snapshot
The Aviation Anti-Submarine Warfare Expert in Military Conceptual Model Based on AHP Confirm Method Research
inferred← citeshttps://doi.org/10.48550/arxiv.2108.09329openalex-snapshot
Wave Function Collapse Coloring: A New Heuristic for Fast Vertex Coloring
inferred← citeshttps://doi.org/10.9781/ijimai.2012.161openalex-snapshot
A Useful Metaheuristic for Dynamic Channel Assignment in Mobile Cellular Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.