Journal: Networks

Found 487 papers in total
A stochastic inventory routing problem for infectious medical waste collection
A stochastic inventory routing problem for infectious medical waste collection
2014,
We consider the problem of designing a logistic system to organize adequate collection...
Network flow spanners
Network flow spanners
2010,
In this article, motivated by applications of ordinary (distance) spanners...
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation
2010,
In this article, the first approach for solving the vertex‐biconnectivity...
An ejection chain algorithm for the quadratic assignment problem
An ejection chain algorithm for the quadratic assignment problem
2010,
In this study, we present a new tabu search algorithm for the quadratic assignment...
A mean‐variance model for the minimum cost flow problem with stochastic arc costs
A mean‐variance model for the minimum cost flow problem with stochastic arc costs
2010,
This article considers a minimum cost flow problem where arc costs are uncertain, and...
Complexity of some inverse shortest path lengths problems
Complexity of some inverse shortest path lengths problems
2010,
The input to an inverse shortest path lengths problem (ISPL) consists of a...
Probabilistic models for the Steiner Tree problem
Probabilistic models for the Steiner Tree problem
2010,
We consider a probabilistic model for the Steiner Tree problem. Under this model, the...
Recent results on Arc Routing Problems: An annotated bibliography
Recent results on Arc Routing Problems: An annotated bibliography
2010,
Arc routing problems are vehicle routing problems in which the tasks to be performed...
Public congestion network situations and related games
Public congestion network situations and related games
2010,
This article analyses congestion in network situations from a cooperative game...
Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
2010,
In the Job Sequencing and Tool Switching Problem, a number of part types, each...
Integrating facility location and production planning decisions
Integrating facility location and production planning decisions
2010,
We consider a metric uncapacitated facility location problem where we must assign each...
The β‐reliable minimax and maximin location problems on a network with probabilistic weights
The β‐reliable minimax and maximin location problems on a network with probabilistic weights
2010,
We study the β‐reliable minimax and maximin location problems on a network...
Optimal routing with failure‐independent path protection
Optimal routing with failure‐independent path protection
2010,
Reliable communication has become crucial in today's information society. Modern...
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
2008,
This article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in...
Solving the hub location problem in a star-star network
Solving the hub location problem in a star-star network
2008,
We consider the problem of locating hubs and assigning terminals to hubs for a...
New approaches for solving the block-to-train assignment problem
New approaches for solving the block-to-train assignment problem
2008,
Railroad planning involves solving two optimization problems: (i) the blocking...
A simple method for improving the primal simplex method for the multicommodity flow problem
A simple method for improving the primal simplex method for the multicommodity flow problem
2008,
We present a new efficient approach for solving the multicommodity flow problem as a...
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case
2008,
We study an optimization problem which can be interesting in several network...
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
2008,
We present cycle-based algorithmic approaches to find local minima of a nonconvex and...
A graph theory approach for designing conservation reserve networks with minimal fragmentation
A graph theory approach for designing conservation reserve networks with minimal fragmentation
2008,
Habitat fragmentation is often cited as one of the most important factors that...
New dynamic programming algorithms for the resource constrained elementary shortest path problem
New dynamic programming algorithms for the resource constrained elementary shortest path problem
2008,
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing...
A Reach and Bound algorithm for acyclic dynamic-programming networks
A Reach and Bound algorithm for acyclic dynamic-programming networks
2008,
Node pruning is a commonly used technique for solution acceleration in a...
A simplex algorithm for minimum-cost network-flow problems in infinite networks
A simplex algorithm for minimum-cost network-flow problems in infinite networks
2008,
We study minimum-cost network-flow problems in networks with a countably infinite...
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
2008,
A multicast session in a wireless ad hoc network concerns routing messages from a...
Papers per page: