The antennas preassignment problem

DOI10.1016/J.CHAOS.2004.02.049MaRDI QIDQ1766595zbMATH OpenOpenAlexFDO

Authors Stratos A. Paschos, Vangelis Th. Paschos, V. Zissimopoulos

Publication date 8 March 2005

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.chaos.2004.02.049

Mathematics Subject Classification ID

Antennas, waveguides in optics and electromagnetic theory (78A50) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A simulated annealing approach for the circular cutting problem
• A channel allocation for cellular mobile radio systems using simulated annealing
• A heuristic approach for antenna positioning in cellular networks
• An improved annealing scheme for the QAP
• Heuristic and simulated annealing algorithms for solving extended cell assignment problem in wireless ATM networks

Cites work

• A simulated annealing approach for the circular cutting problem
• Equation of state calculations by fast computing machines
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Repeated patterns of dense packings of equal disks in a square
• Simulated Annealing – An Annotated Bibliography

Cited in

(3)

• A heuristic approach for antenna positioning in cellular networks
• Optimal Placement of Antennae Using Metaheuristics
• The antenna problem

This page was built for publication: The antennas preassignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766595)