Journal: Networks

Found 487 papers in total
The wireless network jamming problem subject to protocol interference
The wireless network jamming problem subject to protocol interference
2016,
We study the following questions related to wireless network security: Which jammer...
A linear time algorithm for the unbalanced Hitchcock transportation problem
A linear time algorithm for the unbalanced Hitchcock transportation problem
2016,
The Hitchcock transportation problem is a special case of the minimum cost flow...
The traveling salesman problem with pickup, delivery, and ride-time constraints
The traveling salesman problem with pickup, delivery, and ride-time constraints
2016,
In the traveling salesman problem with pickup, delivery, and ride‐time...
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem
2016,
In this article, we study the k‐edge‐connected...
Line-broadcasting in complete k-ary trees
Line-broadcasting in complete k-ary trees
2016,
A line‐broadcasting model in a connected graph G = ( V , E ) , | V...
A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards
A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards
2016,
This article presents a novel matheuristic for solving the hump yard...
Metric tree-like structures in real-world networks: an empirical study
Metric tree-like structures in real-world networks: an empirical study
2016,
Based on solid theoretical foundations, we present strong evidence that a number of...
Dynamic vehicle routing problems: Three decades and counting
Dynamic vehicle routing problems: Three decades and counting
2016,
Since the late 70s, much research activity has taken place on the class of dynamic...
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model
2016,
In the broadcast version of the congested clique model, n nodes communicate in...
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
2016,
We consider a connected graph G with n vertices, p of which are centers, while the...
Heuristic Based Real-Time Train Rescheduling System
Heuristic Based Real-Time Train Rescheduling System
2016,
This article deals with the problem of train rescheduling on a railway network....
Optimizing robustness in geometric routing via embedding redundancy and regeneration
Optimizing robustness in geometric routing via embedding redundancy and regeneration
2015,
Geometric routing is an alternative to traditional routing algorithms in which traffic...
Availability-based path selection and network vulnerability assessment
Availability-based path selection and network vulnerability assessment
2015,
In data‐communication networks, network reliability is of great concern to both...
An effective algorithm for computing all-terminal reliability bounds
An effective algorithm for computing all-terminal reliability bounds
2015,
The exact calculation of all‐terminal reliability is not feasible in large...
Region-based fault-tolerant distributed file storage system design in networks
Region-based fault-tolerant distributed file storage system design in networks
2015,
Distributed storage of data files in different nodes of a network enhances its fault...
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem
2015,
The capacitated fixed‐charge network design (FCND) problem considers the...
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
2015,
Let G = ( V , E ) be a simple graph with | V | = n vertices and |...
Generalized elastic flow rerouting scheme
Generalized elastic flow rerouting scheme
2015,
The present study deals with Elastic Flow Rerouting (EFR)–an original traffic...
Geodiverse routing with path delay and skew requirement under area-based challenges
Geodiverse routing with path delay and skew requirement under area-based challenges
2015,
With the increasing frequency of natural disasters and intentional attacks that...
SRLG failure localization using nested m-trails and their application to adaptive probing
SRLG failure localization using nested m-trails and their application to adaptive probing
2015,
This article explores a recently introduced novel technique called the nested...
Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks
Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks
2015,
Elastic optical network (EON) is a novel optical technology introduced recently to...
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
2015,
Random hashing is a standard method to balance loads among nodes in...
Critical nodes for distance-based connectivity and related problems in graphs
Critical nodes for distance-based connectivity and related problems in graphs
2015,
This study considers a class of critical node detection problems that involves...
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
2015,
We develop a variant of the variable neighborhood search (VNS) metaheuristic called...
Papers per page: