Journal: Networks

Found 487 papers in total
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
2004,
In a previous article, using underlying graph theoretical properties, Gouveia and...
The Push Tree problem
The Push Tree problem
2004,
In this article, we introduce the Push Tree problem, which exposes the tradeoffs...
An implicit enumeration scheme for the batch selection problem
An implicit enumeration scheme for the batch selection problem
2004,
An important problem arising in the management of logistic networks is the following:...
Decomposition techniques for the minimum toll revenue problem
Decomposition techniques for the minimum toll revenue problem
2004,
The objective of the minimum toll revenue (MINREV) problem is to find tolls that...
A stochastic integer programming approach to solving a synchronous optical network ring design problem
A stochastic integer programming approach to solving a synchronous optical network ring design problem
2004,
We develop stochastic integer programming techniques tailored toward solving a...
Solving the asymmetric traveling salesman problem with periodic constraints
Solving the asymmetric traveling salesman problem with periodic constraints
2004,
In this article we describe a heuristic algorithm to solve the asymmetrical traveling...
A direct cycle-based column-and-cut generation method for capacitated survivable network design
A direct cycle-based column-and-cut generation method for capacitated survivable network design
2004,
A network is said to be survivable if it has sufficient capacity for rerouting all of...
The maximum-leaf spanning tree problem: Formulations and facets
The maximum-leaf spanning tree problem: Formulations and facets
2004,
The Maximum Leaf Spanning Tree Problem (MLSTP) is to find a spanning tree in a given...
Algorithms for a network design problem with crossing supermodular demands
Algorithms for a network design problem with crossing supermodular demands
2004,
We present approximation algorithms for a class of directed network design problems....
Algorithms for minimum-cost paths in time-dependent networks with waiting policies
Algorithms for minimum-cost paths in time-dependent networks with waiting policies
2004,
We study the problem of computing minimum-cost paths through a time-varying network,...
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
2004,
In this article the modulation of intensity matrices arising in cancer radiation...
Large-scale local search heuristics for the capacitated vertex p-center problem
Large-scale local search heuristics for the capacitated vertex p-center problem
2004,
This article investigates the application of very large neighborhood search techniques...
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks
2004,
In a recent article Averbakh and Berman present an O(p 3  + n 2 ) serial...
Probabilistic location problems with discrete demand weights
Probabilistic location problems with discrete demand weights
2004,
In this article we consider four models for locating a facility on an undirected...
The 2-path network problem
The 2-path network problem
2004,
Given a graph with nonnegative edge weights and a set D of node pairs, the 2-path...
Minimum-cost dynamic flows: The series-parallel case
Minimum-cost dynamic flows: The series-parallel case
2004,
A dynamic network consists of a directed graph with capacities, costs, and integral...
The Ring Star problem: polyhedral analysis and exact algorithm
The Ring Star problem: polyhedral analysis and exact algorithm
2004,
In the Ring Star Problem, the aim is to locate a simple cycle through a subset of...
A hybrid multicommodity routing algorithm for traffic engineering
A hybrid multicommodity routing algorithm for traffic engineering
2004,
Traffic engineering seeks to route traffic demands in data networks to guarantee...
Minimal path broadcast networks
Minimal path broadcast networks
2004,
Broadcasting is the communication process whereby a message that is initially known by...
An exact algorithm for the min-cost network containment problem
An exact algorithm for the min-cost network containment problem
2004,
A network design problem which arises in the distribution of a public utility provided...
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
2004,
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning...
The absolute center of a network
The absolute center of a network
2004,
This paper presents a new algorithm for finding an absolute center (minimax criterion)...
Optimization of Internet Protocol network design and routing
Optimization of Internet Protocol network design and routing
2004,
We consider network design and routing for Internet Protocol (IP) traffic. The design...
Reoptimizing the traveling salesman problem
Reoptimizing the traveling salesman problem
2003,
In this paper, we study the reoptimization problems which arise when a new node is...
Papers per page: