The antennas preassignment problem
From MaRDI portal
Publication:1766595
DOI10.1016/j.chaos.2004.02.049zbMath1070.90091OpenAlexW2072545416MaRDI QIDQ1766595
Vangelis Th. Paschos, Stratos A. Paschos, Vassilios 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Antennas, waveguides in optics and electromagnetic theory (78A50)
Cites Work
- A simulated annealing approach for the circular cutting problem
- Repeated patterns of dense packings of equal disks in a square
- Simulated Annealing – An Annotated Bibliography
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Equation of State Calculations by Fast Computing Machines
- Unnamed Item
- Unnamed Item
This page was built for publication: The antennas preassignment problem