The problem of selecting a subset of links so as to minimize the sum of shortest path distances between all pairs of nodes, subject to a budget constraint on total length of links, may be solved by a modification of a branch-and-bound algorithm developed for optimal variable selection problems in statistics. The modified algorithm is described in detail, and encouraging computational experience on 10 node networks is reported. The use of the algorithm as a heuristic approach to solving the optimal network problem is also discussed.
AbstractNetwork design models with more than one facility type have many applications in communicati...
We consider the problem of determining a set of optimal tariffs for an agent in the network, who own...
We consider the problem of determining a set of optimal tariffs for an agent in the network, who own...
Abstract. The problem of selecting a subset of links so as to minimize the sum of shortest path dist...
This paper is a survey of recent improvements in algorithms for four classical network optimization ...
Copyright © 2009, by the author(s). Please do not quote, cite, or reproduce without permission from ...
The shortest path problem is one of the classic network problems. The objective of this problem is t...
Given a set of candidate road projects associated with costs, finding the best subset with respect t...
Given a set of candidate road projects associated with costs, finding the best subset with respect t...
Given a set of points and distances between them, a basic problem in network design calls for select...
Plant location as a centralized planning objective in which some agency has control over most of the...
In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Bran...
Plant location as a centralized planning objective in which some agency has control over most of the...
Traveling Salesman Problem is one of Ihe most intensively studied problems in computational mathemat...
An algorithm is presented that finds the optimal plan long-term transmission for till cases studied,...
AbstractNetwork design models with more than one facility type have many applications in communicati...
We consider the problem of determining a set of optimal tariffs for an agent in the network, who own...
We consider the problem of determining a set of optimal tariffs for an agent in the network, who own...
Abstract. The problem of selecting a subset of links so as to minimize the sum of shortest path dist...
This paper is a survey of recent improvements in algorithms for four classical network optimization ...
Copyright © 2009, by the author(s). Please do not quote, cite, or reproduce without permission from ...
The shortest path problem is one of the classic network problems. The objective of this problem is t...
Given a set of candidate road projects associated with costs, finding the best subset with respect t...
Given a set of candidate road projects associated with costs, finding the best subset with respect t...
Given a set of points and distances between them, a basic problem in network design calls for select...
Plant location as a centralized planning objective in which some agency has control over most of the...
In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Bran...
Plant location as a centralized planning objective in which some agency has control over most of the...
Traveling Salesman Problem is one of Ihe most intensively studied problems in computational mathemat...
An algorithm is presented that finds the optimal plan long-term transmission for till cases studied,...
AbstractNetwork design models with more than one facility type have many applications in communicati...
We consider the problem of determining a set of optimal tariffs for an agent in the network, who own...
We consider the problem of determining a set of optimal tariffs for an agent in the network, who own...