Matches in SemOpenAlex for { <https://semopenalex.org/work/W2550892796> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W2550892796 endingPage "178" @default.
- W2550892796 startingPage "173" @default.
- W2550892796 abstract "The network design problem (NDP) is a well known problem which can be applied to many different types of networks. It was well investigated applied to computer communications networks during the time of Internet development. Today it is again very actual applied mostly to the dynamic wireless networks (MANET - mobile ad hoc networks). The network design problem is an NP-hard problem which involves topology selection (subset of possible links) and routing determination (paths for the offered traffic). Capacity assignment is usually treated as a 0-1 problem and as such included it in the topology problem. This does not make the network design problem easier, just the opposite, it moves optimization from continuous to integer. The goal is to minimize the cost which can be a combination of the link costs and delay penalties, under possible additional constraints. Such hard combinatorial graph problems are often treated by evolutionary metaheuristics. In many cases better results and faster convergence are achieved by hybrid algorithms where some local searcher that utilizes particular knowledge about the corresponding problem is included. Here we propose and analyze a computationally feasible heuristic algorithm which excludes underutilized links by a version of flow-deviation method. A simplified queuing model is developed for cost function estimate. Some theoretical results are also established that direct initial approximation. Proposed algorithm can dynamically be adjusted for faster or better results. It is implemented and computes a good solution that is robust with respect to often required dynamic changes of the cost function." @default.
- W2550892796 created "2016-11-30" @default.
- W2550892796 creator A5067245090 @default.
- W2550892796 date "2010-06-13" @default.
- W2550892796 modified "2023-09-27" @default.
- W2550892796 title "A heuristic algorithm for the network design problem" @default.
- W2550892796 cites W120125775 @default.
- W2550892796 cites W157889690 @default.
- W2550892796 cites W1980268350 @default.
- W2550892796 cites W1981599878 @default.
- W2550892796 cites W2072701932 @default.
- W2550892796 cites W2118965673 @default.
- W2550892796 cites W2504279900 @default.
- W2550892796 cites W50672539 @default.
- W2550892796 hasPublicationYear "2010" @default.
- W2550892796 type Work @default.
- W2550892796 sameAs 2550892796 @default.
- W2550892796 citedByCount "0" @default.
- W2550892796 crossrefType "journal-article" @default.
- W2550892796 hasAuthorship W2550892796A5067245090 @default.
- W2550892796 hasConcept C11413529 @default.
- W2550892796 hasConcept C114563136 @default.
- W2550892796 hasConcept C126255220 @default.
- W2550892796 hasConcept C126980161 @default.
- W2550892796 hasConcept C137836250 @default.
- W2550892796 hasConcept C173801870 @default.
- W2550892796 hasConcept C199845137 @default.
- W2550892796 hasConcept C31258907 @default.
- W2550892796 hasConcept C33923547 @default.
- W2550892796 hasConcept C41008148 @default.
- W2550892796 hasConceptScore W2550892796C11413529 @default.
- W2550892796 hasConceptScore W2550892796C114563136 @default.
- W2550892796 hasConceptScore W2550892796C126255220 @default.
- W2550892796 hasConceptScore W2550892796C126980161 @default.
- W2550892796 hasConceptScore W2550892796C137836250 @default.
- W2550892796 hasConceptScore W2550892796C173801870 @default.
- W2550892796 hasConceptScore W2550892796C199845137 @default.
- W2550892796 hasConceptScore W2550892796C31258907 @default.
- W2550892796 hasConceptScore W2550892796C33923547 @default.
- W2550892796 hasConceptScore W2550892796C41008148 @default.
- W2550892796 hasLocation W25508927961 @default.
- W2550892796 hasOpenAccess W2550892796 @default.
- W2550892796 hasPrimaryLocation W25508927961 @default.
- W2550892796 hasRelatedWork W1491335015 @default.
- W2550892796 hasRelatedWork W1501704428 @default.
- W2550892796 hasRelatedWork W198748327 @default.
- W2550892796 hasRelatedWork W2004407130 @default.
- W2550892796 hasRelatedWork W2063841170 @default.
- W2550892796 hasRelatedWork W2099223156 @default.
- W2550892796 hasRelatedWork W2105019561 @default.
- W2550892796 hasRelatedWork W2114500316 @default.
- W2550892796 hasRelatedWork W2135195639 @default.
- W2550892796 hasRelatedWork W2140234885 @default.
- W2550892796 hasRelatedWork W2158645682 @default.
- W2550892796 hasRelatedWork W2163671112 @default.
- W2550892796 hasRelatedWork W2168230640 @default.
- W2550892796 hasRelatedWork W2344094226 @default.
- W2550892796 hasRelatedWork W2571067820 @default.
- W2550892796 hasRelatedWork W2789023074 @default.
- W2550892796 hasRelatedWork W2911743271 @default.
- W2550892796 hasRelatedWork W3048476541 @default.
- W2550892796 hasRelatedWork W37997015 @default.
- W2550892796 hasRelatedWork W1753967158 @default.
- W2550892796 isParatext "false" @default.
- W2550892796 isRetracted "false" @default.
- W2550892796 magId "2550892796" @default.
- W2550892796 workType "article" @default.