Journal: Networks

Found 487 papers in total
The stochastic close-enough arc routing problem
The stochastic close-enough arc routing problem
2017,
The Stochastic Close‐Enough Arc Routing Problem is a challenging problem where...
Restricted swap-based neighborhood search for the minimum connected dominating set problem
Restricted swap-based neighborhood search for the minimum connected dominating set problem
2017,
The minimum connected dominating set problem (MCDSP) has become increasingly important...
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach
2017,
We propose a two‐stage stochastic programming framework for designing or...
Two node-disjoint hop-constrained survivable network design and polyhedra
Two node-disjoint hop-constrained survivable network design and polyhedra
2016,
Given a weighted undirected graph G with a set of pairs of terminals (s i , t i ), i =...
A note on detecting unbounded instances of the online shortest path problem
A note on detecting unbounded instances of the online shortest path problem
2016,
The online shortest path problem is a type of stochastic shortest path problem in...
Algorithms and complexity results for finding graphs with extremal Randic index
Algorithms and complexity results for finding graphs with extremal Randic index
2016,
We show that finding a subgraph realization with the minimum generalized Randić...
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
2016,
Flow cover inequalities are among the most effective valid inequalities for...
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
2016,
Ejection chain methods, which include the classical Lin–Kernighan (LK) procedure...
Partial target coverage to extend the lifetime in wireless multi-role sensor networks
Partial target coverage to extend the lifetime in wireless multi-role sensor networks
2016,
This article studies the effect of partial coverage to extend the lifetime of wireless...
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
2016,
We consider a content distribution network (CDN) in which data hubs or servers are...
Heuristics for a hub location-routing problem
Heuristics for a hub location-routing problem
2016,
We investigate a variant of the many‐to‐many hub location‐routing...
The power edge set problem
The power edge set problem
2016,
The automated real time control of an electrical network is achieved through the...
Locating depots for capacitated vehicle routing
Locating depots for capacitated vehicle routing
2016,
We study a location‐routing problem in the context of capacitated vehicle...
The ring/κ-rings network design problem: Model and branch-and-cut algorithm
The ring/κ-rings network design problem: Model and branch-and-cut algorithm
2016,
This article considers the problem of designing a two‐level network where the...
A characterization of irreducible infeasible subsystems in flow networks
A characterization of irreducible infeasible subsystems in flow networks
2016,
Infeasible network flow problems with supplies and demands can be characterized via...
Capacitated network design games with weighted players
Capacitated network design games with weighted players
2016,
We consider network design games with weighted players and uniform edge capacities and...
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach
2016,
This paper deals with the problem of capacity expansion of a network under independent...
Availability-driven optimal design of shared path protection in WDM networks
Availability-driven optimal design of shared path protection in WDM networks
2016,
Availability, defined as the fraction of time a network service is operative, is a key...
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
2016,
In this paper, we consider the Mixed Capacitated General Routing Problem which is a...
The driver assignment vehicle routing problem
The driver assignment vehicle routing problem
2016,
We introduce the driver assignment vehicle routing problem, DAVRP. In this problem,...
Robust models for linear programming with uncertain right hand side
Robust models for linear programming with uncertain right hand side
2016,
We propose new robust models for handling right hand side uncertainty in linear...
On the roots of the node reliability polynomial
On the roots of the node reliability polynomial
2016,
Given a graph G whose edges are perfectly reliable and whose nodes each operate...
The Rainbow Cycle Cover Problem
The Rainbow Cycle Cover Problem
2016,
We model and solve the Rainbow Cycle Cover Problem (RCCP). Given a connected and...
Minimal disconnected cuts in planar graphs
Minimal disconnected cuts in planar graphs
2016,
The problem of finding a disconnected cut in a graph is NP‐hard in general but...
Papers per page: