CALMA

swMATH3235MaRDI QIDQ15768FDOQ15768

Author name not available (Why is that?)

Described by source

• Algorithms for Radio Link Frequency Assignment: The Calma Project

Cited In (only showing first 100 items - show all)

• Partial integration of frequency allocation within antenna positioning in GSM mobile networks
• Models and solution techniques for frequency assignment problems
• Absolute and asymptotic bounds for online frequency allocation in cellular networks
• An efficient self-stabilizing distance-2 coloring algorithm
• Greedy online frequency allocation in cellular networks
• Heuristics for the bandwidth colouring problem
• Labeling trees with a condition at distance two
• Lower and upper bounds for the bin packing problem with fragile objects
• Three results on frequency assignment in linear cellular networks
• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
• Title not available (Why is that?)
• A simple branching scheme for vertex coloring problems
• Graph labellings with variable weights, a survey
• Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
• Weighted improper colouring
• An investigation into two bin packing problems with ordering and orientation implications
• The clique problem in intersection graphs of ellipses and triangles
• Channel assignment for interference avoidance in honeycomb wireless networks
• Modeling the packing coloring problem of graphs
• Safe separators for treewidth
• A column generation and branch-and-cut algorithm for the channel assignment problem
• A memetic algorithm for channel assignment in wireless FDMA systems
• The stable set problem and the thinness of a graph
• Title not available (Why is that?)
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Tight LP‐based lower bounds for wavelength conversion in optical networks
• \(L(h,k)\)-labelings of Hamming graphs
• Structural Information and Communication Complexity
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• Efficient filtering and tabu search on a consistent neighbourhood for the frequency assignment problem with polarisation
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
• A variable depth search branching
• Mathematical Optimization Models for WLAN Planning
• Frequency reassignment problem in mobile communication networks
• The vertex coloring problem and its generalizations
• Three tabu search methods for the MI-FAP applied to 802.11 networks
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
• A supernodal formulation of vertex colouring with applications in course timetabling
• Better bounds for incremental frequency allocation in bipartite graphs
• Models and methods for frequency assignment with cumulative interference constraints
• A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications
• Models and solution techniques for frequency assignment problems
• Note on coloring of double disk graphs
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• Algorithms for the generalized weighted frequency assignment problem
• Cellular network configuration with co-channel and adjacent-channel interference constraints
• A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
• Heuristic manipulation, tabu search and frequency assignment
• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
• Optimizing base station location and configuration in UMTS networks
• Frequency assignment problem in satellite communications using differential evolution
• Solving a minimum-power covering problem with overlap constraint for cellular network design
• \(L(2,1)\)-labelings of some families of oriented planar graphs
• \(L(2,1)\)-labeling of oriented planar graphs
• Solving partial constraint satisfaction problems with tree decomposition
• Price of anarchy for graph coloring games with concave payoff
• Elementary landscape decomposition of the frequency assignment problem
• A survey on vertex coloring problems
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• The dynamic frequency assignment problem
• Bounds on spectrum graph coloring
• Domination analysis of greedy heuristics for the frequency assignment problem.
• Frequency assignment in a SDMA satellite communication system with beam decentring feature
• Genetic tabu search for robust fixed channel assignment under dynamic traffic data
• A column generation based algorithm for the robust graph coloring problem
• An evolutionary approach for bandwidth multicoloring problems
• An Efficient Self-stabilizing Distance-2 Coloring Algorithm
• Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
• Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem
• Surveys in operations research
• Solving a multicoloring problem with overlaps using integer programming
• Methods for operations planning in airport decision support systems
• Methods for operations planning in airport decision support systems
• Solving the frequency assignment problem with polarization by local search and tabu
• Acyclic Orientations with Path Constraints
• Optimized planning of frequency hopping in cellular networks
• Circular backbone colorings: on matching and tree backbones of planar graphs
• Accurate optimization models for interference constrained bandwidth allocation in cellular networks
• Matchings under distance constraints. I
• A two-level graph partitioning problem arising in mobile wireless communications
• Eleven surveys in operations research
• Total tessellation cover: bounds, hardness, and applications
• Title not available (Why is that?)
• Twelve surveys in operations research
• An exact algorithm for the edge coloring by total labeling problem
• Polyhedral studies for minimum‐span graph labelling with integer distance constraints
• Computational complexity of distance edge labeling
• Theoretical Computer Science
• Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks
• Spectrum graph coloring and applications to Wi-Fi channel assignment
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
• Solving frequency assignment problems via tree-decomposition
• Title not available (Why is that?)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• 2-dipath and oriented \(L(2, 1)\)-labelings of some families of oriented planar graphs
• Exact and approximate methods for the score-constrained packing problem
• Collective dynamics of phase-repulsive oscillators solves graph coloring problem
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
• Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures

This page was built for software: CALMA