Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A tabu search algorithm for the optimisation of telecommunication networks

From MaRDI portal
Publication:1609900
Jump to:navigation, search

DOI10.1016/S0377-2217(97)00279-8zbMath0991.90025MaRDI QIDQ1609900

Giorgio Giacinto, Eugenio Costamagna, Alessandra Fanni

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)


zbMATH Keywords

communicationtabu searchoptimisation


Mathematics Subject Classification ID

Communication networks in operations research (90B18) Search theory (90B40)


Related Items

Using metaheuristics in multiobjective resource constrained project scheduling, A tabu search algorithm for parallel machine total tardiness problem, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments, An efficient heuristic to dimension large-scale hybrid optoelectronic networks


Uses Software

  • Tabu search


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Topological design of computer communication networks -- the overall design problem
  • A user's guide to tabu search
  • Tabu Search—Part I
  • Large-Scale Network Topological Optimization
  • Bandwidth Packing: A Tabu Search Approach
  • A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1609900&oldid=13909732"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki