Publication:4663414
From MaRDI portal
zbMath1069.68021MaRDI QIDQ4663414
Publication date: 30 March 2005
Full work available at URL: http://www.sciencedirect.com/science/book/9780125571890
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68M10: Network design and communication in computer systems
Related Items
Securely Connected Facility Location in Metric Graphs, Nash equilibrium design and price-based coordination in hierarchical systems, Intra-domain traffic engineering with shortest path routing protocols, Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity, Intra-domain traffic engineering with shortest path routing protocols, Telecommunications network design: Technology impacts and future directions, An extreme‐point tabu‐search algorithm for fixed‐charge network problems, An efficient approach to optimization of semi‐stable routing in multicommodity flow networks, Survivable network design with shared-protection routing, Integral flow decomposition with minimum longest path length, Near optimal design of wavelength routed optical networks, A hybrid column generation with GRASP and path relinking for the network load balancing problem, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, Mixed integer non-linear programming models for green network design, Optimal design of virtual links in AFDX networks, Fractional routing using pairs of failure-disjoint paths, An \(s\)-\(t\) connection problem with adaptability, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, An integer programming algorithm for routing optimization in IP networks, Survivable network design with demand uncertainty, Large margin shortest path routing, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Traffic engineering of tunnel-based networks with class specific diversity requirements, A mixed-integer approach to Core-Edge design of storage area networks, Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks, Maximizing residual capacity in connection-oriented networks, Inequality measures and equitable locations, An improved Benders decomposition applied to a multi-layer network design problem, Core-edge design of storage area networks-a single-edge formulation with problem-specific cuts, Network design in scarce data environment using moment-based distributionally robust optimization, Path generation for affine flow thinning, Models for the piecewise linear unsplittable multicommodity flow problems, Modeling the steering of international roaming traffic, A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project, Optimization algorithms for resilient path selection in networks, On the isometric path partition problem, Refined parameterizations for computing colored cuts in edge-colored graphs, Realizing secret sharing with general access structure, Threshold accepting heuristic for fair flow optimization in wireless mesh networks, Editorial. Fair optimization and networks: models, algorithms, and applications, An approximation algorithm for the facility location problem with lexicographic minimax objective, Fair optimization and networks: a survey, Max-min fairness in multi-commodity flows, On a bicriterion server allocation problem in a multidimensional Erlang loss system, Towards optimizing the deployment of optical access networks, Unnamed Item, Unnamed Item, Unnamed Item, Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs, Graphs and Algorithms in Communication Networks on Seven League Boots, Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach, Optimization of OSPF Routing in IP Networks, A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks, An Integer Programming Algorithm for Routing Optimization in IP Networks, A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes, A New Necessary Condition for Shortest Path Routing
