scientific article; zbMATH DE number 5070513
From MaRDI portal
Publication:5395365
zbMath1100.90001MaRDI QIDQ5395365
No author found.
Publication date: 2 November 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00) Operations research and management science (90Bxx)
Related Items (40)
A combinatorial algorithm for the TDMA message scheduling problem ⋮ System modeling and performance analysis of the power saving class type II in BWA networks ⋮ Mathematical programming approaches for dual multicast routing problem with multilayer risk cost ⋮ Exact interdiction models and algorithms for disconnecting networks via node deletions ⋮ Min-energy broadcast in mobile ad hoc networks with restricted motion ⋮ Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks ⋮ An exact algorithm for a resource allocation problem in mobile wireless communications ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ An integer programming framework for critical elements detection in graphs ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization ⋮ The wireless network jamming problem ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Performance analysis and evaluation of an enhanced power saving class type III in IEEE 802.16 with self-similar traffic ⋮ Topology design for on-demand dual-path routing in wireless networks ⋮ Sufficient conditions for protection routing in IP networks ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ Mixed-integer nonlinear programs featuring ``on/off constraints ⋮ Data transfer planning with tree placement for collaborative environments ⋮ Approximate dynamic programming for link scheduling in wireless mesh networks ⋮ Bi-perspective functions for mixed-integer fractional programs with indicator variables ⋮ Jamming communication networks under complete uncertainty ⋮ A two-level graph partitioning problem arising in mobile wireless communications ⋮ Financial networks with intermediation and transportation network equilibria: A supernetwork equivalence and reinterpretation of the equilibrium conditions with computations ⋮ The internet, evolutionary variational inequalities, and the time-dependent Braess paradox ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ A cooperative differential game model based on network throughput and energy efficiency in wireless networks ⋮ Capacity optimization through sensing threshold adaptation for cognitive radio networks ⋮ Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints ⋮ Maximum information stored in a labeled connected network with minimum edges ⋮ Models and complexity of problems of design and reconstruction of telecommunication and transport systems ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Reformulations and solution algorithms for the maximum leaf spanning tree problem ⋮ Towards optimizing the deployment of optical access networks ⋮ Complexity of a classical flow restoration problem ⋮ Detecting critical nodes in sparse graphs ⋮ Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Optimal-constrained multicast sub-graph over coded packet networks
This page was built for publication: