Journal: Networks

Found 487 papers in total
Minimum bottleneck spanning trees with degree bounds
Minimum bottleneck spanning trees with degree bounds
2016,
Given a graph G with edge lengths, the minimum bottleneck spanning tree (MBST) problem...
Designing networks: A mixed-integer linear optimization approach
Designing networks: A mixed-integer linear optimization approach
2016,
Designing networks with specified collective properties is useful in a variety of...
The bottleneck selected-internal and partial terminal Steiner tree problems
The bottleneck selected-internal and partial terminal Steiner tree problems
2016,
Given a complete graph G = ( V , E ) , a positive length function on edges, and two...
Mixed planar and network single-facility location problems
Mixed planar and network single-facility location problems
2016,
We consider the problem of optimally locating a single facility anywhere in a network...
Dynamic shortest-path interdiction
Dynamic shortest-path interdiction
2016,
We study a dynamic network game between an attacker and a user. The user wishes to...
Reformulation and decomposition approaches for traffic routing in optical networks
Reformulation and decomposition approaches for traffic routing in optical networks
2016,
We consider a multilayer network design model arising from a real‐life...
Inflection points of reliability polynomials are dense in [0,1]
Inflection points of reliability polynomials are dense in [0,1]
2016,
Suppose we have a graph G (finite and undirected) where the vertices of G are always...
A node-based ILP formulation for the node-weighted dominating Steiner problem
A node-based ILP formulation for the node-weighted dominating Steiner problem
2017,
In this article, we consider the Node‐Weighted Dominating Steiner Problem....
Lightpath admission control and rerouting in dynamic flex-grid optical transport networks
Lightpath admission control and rerouting in dynamic flex-grid optical transport networks
2017,
In dynamic flex‐grid optical transport networks, Lightpath Admission Control...
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
2017,
During the planning of communication networks, the routing decision process...
Cheapest paths in dynamic networks
Cheapest paths in dynamic networks
2017,
Flows over time problems relate to finding optimal flows over a capacitated network...
A penalized best-response algorithm for nonlinear single-path routing problems
A penalized best-response algorithm for nonlinear single-path routing problems
2017,
This article is devoted to nonlinear single‐path routing problems, which are...
The budgeted minimum cost flow problem with unit upgrading cost
The budgeted minimum cost flow problem with unit upgrading cost
2017,
The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the...
Survivable green traffic engineering with shared protection
Survivable green traffic engineering with shared protection
2017,
This article focuses on the problem of minimizing the energy consumption in a...
Network pricing problem with unit toll
Network pricing problem with unit toll
2017,
In the so‐called network pricing problem an authority owns some arcs of the...
Reduced-size formulations for metric and cut polyhedra in sparse graphs
Reduced-size formulations for metric and cut polyhedra in sparse graphs
2017,
Given a graph G = ( V , E ) with | V | = n and | E | = m ,...
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
2017,
Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a...
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game
2017,
In this work, a multiagent network flow problem is addressed, aiming at characterizing...
A simple and efficient strategy for solving very large-scale generalized cable-trench problems
A simple and efficient strategy for solving very large-scale generalized cable-trench problems
2016,
Vasko et al. (2002), defined the cable-trench problem (CTP) as a combination of the...
On provably best construction heuristics for hard combinatorial optimization problems
On provably best construction heuristics for hard combinatorial optimization problems
2016,
In this article, a heuristic is said to be provably best if, assuming P N P , no other...
Local search metaheuristics for the critical node problem
Local search metaheuristics for the critical node problem
2016,
We present two metaheuristics for the Critical Node Problem, that is, the maximal...
An equi-model matheuristic for the multi-depot ring star problem
An equi-model matheuristic for the multi-depot ring star problem
2016,
In the multi‐depot ring star problem (MDRSP), a set of customers has to be...
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry
2016,
We study a new multiobjective job scheduling problem on nonidentical machines with...
An iterated local search algorithm for water distribution network design optimization
An iterated local search algorithm for water distribution network design optimization
2016,
The optimal design of water distribution networks is a complex non‐linear...
Papers per page: