Results 11  20
of
74
Designing Private Line Networks  Polyhedral Analysis and Computation
, 1996
"... We study a capacitated network design problem arising in the design of private line networks. Given a complete graph, a subset of its node set (the "hub" set), and pointtopoint traffic demands, the objective is to install capacity on the edges (using several batch sizes and nonlinear cos ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
We study a capacitated network design problem arising in the design of private line networks. Given a complete graph, a subset of its node set (the "hub" set), and pointtopoint traffic demands, the objective is to install capacity on the edges (using several batch sizes and nonlinear
Approximability of Capacitated Network Design
"... Abstract. In the capacitated survivable network design problem (CapSNDP), we are given an undirected multigraph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimumcut requirements. Unlike its classical specia ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract. In the capacitated survivable network design problem (CapSNDP), we are given an undirected multigraph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimumcut requirements. Unlike its classical
Survivable Network Design: The Capacitated Minimum Spanning Network Problem
 In Proc. 7th INFORMS Telecommunications Conf
, 2004
"... We are given an undirected graph G = (V; E) with positive weights on its vertices representing demands, and nonnegative costs on its edges. Also given are a capacity constraint k, and root vertex r 2 V . In this paper, we consider the capacitated minimum spanning network (CMSN) problem, which as ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We are given an undirected graph G = (V; E) with positive weights on its vertices representing demands, and nonnegative costs on its edges. Also given are a capacity constraint k, and root vertex r 2 V . In this paper, we consider the capacitated minimum spanning network (CMSN) problem, which
Designing Private Line Networks
, 1999
"... We study a capacitated network design problem arising in the design of private line networks. Given a complete graph, a subset of its node set (the "hub" set), and pointtopoint traffic demands, the objective is to install capacity on the edges (using several batch sizes and nonlinear cos ..."
Abstract
 Add to MetaCart
We study a capacitated network design problem arising in the design of private line networks. Given a complete graph, a subset of its node set (the "hub" set), and pointtopoint traffic demands, the objective is to install capacity on the edges (using several batch sizes and nonlinear
Approximation Algorithms for a Capacitated Network Design Problem
 In APPROX
, 2000
"... We study a network loading problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support flows at minimum cost. Capacity can be purchased only in multiples of a fixed quantity ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
We study a network loading problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support flows at minimum cost. Capacity can be purchased only in multiples of a fixed
. Approximability of Capacitated Network Design
"... Abstract. In the capacitated survivable network design problem (CapSNDP), we are given an undirected multigraph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimumcut requirements. Unlike its classical specia ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In the capacitated survivable network design problem (CapSNDP), we are given an undirected multigraph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimumcut requirements. Unlike its classical
THE INVERSE BOUNDARY PROBLEM FOR GENERAL PLANAR ELECTRICAL NETWORKS
"... Abstract. We consider an electrical network where each edge is consists of resistor, inductor, and capacitor joined in parallel. We will make sense of NewmanntoDirichlet map for these networks. We will prove that any recoverable resistor network is still recoverable when capacitance and inductan ..."
Abstract
 Add to MetaCart
Abstract. We consider an electrical network where each edge is consists of resistor, inductor, and capacitor joined in parallel. We will make sense of NewmanntoDirichlet map for these networks. We will prove that any recoverable resistor network is still recoverable when capacitance
Nodecapacitated ring routing
, 2001
"... We consider the nodecapacitated routing problem in an undirected ring network along with its fractional relaxation, the nodecapacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
there is even an integervalued multicommodity flow which violates each nodecapacity by at most one. Our approach gives rise to a combinatorial, strongly polynomial algorithm to compute either a violating doublecut or a nodecapacitated multicommodity flow. A relation of the problem to its edgecapacitated
Capacitated Network Design Games
"... We study a capacitated symmetric network design game, where each of n agents wishes to construct a path from a network’s source to its sink, and the cost of each edge is shared equally among its agents. The uncapacitated version of this problem has been introduced by Anshelevich et al. (2003) and ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study a capacitated symmetric network design game, where each of n agents wishes to construct a path from a network’s source to its sink, and the cost of each edge is shared equally among its agents. The uncapacitated version of this problem has been introduced by Anshelevich et al. (2003
Capacitated network design with multicast commodities
 PROCEEDINGS IN THE 8TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATION SYSTEMS
, 2000
"... This paper addresses the problem of designing a minimum cost network whose capacities are sufficiently large to allow a feasible routing of a given set of multicast commodities. A multicast commodity consists of a set of two or more terminals that need to be connected by a so called broadcast tree, ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
, which consumes on all of its edges a capacity as large as the demand value associated with that commodity. We model the network design problem with multicast commodities as the problem of packing capacitated Steiner trees in a graph. In the first part of the paper we present three mixed
Results 11  20
of
74