Results 1  10
of
514,429
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 658 (27 self)
 Add to MetaCart
its traffic on the minimumlatency path available to it, given the network congestion caused by the other users. In general such a “selfishly motivated ” assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 648 (82 self)
 Add to MetaCart
GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 412 (21 self)
 Add to MetaCart
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization
Upgrading of
, 1997
"... trademarks for the upgraded fuels discussed in this document. PDF and CDL are registered trademarks of the ENCOAL Corporation, and SynCoal is a registered trademark of the Rosebud SynCoal Partnership. These marks are so identified when the products are identified initially, but for readability, the ..."
Abstract
 Add to MetaCart
trademarks for the upgraded fuels discussed in this document. PDF and CDL are registered trademarks of the ENCOAL Corporation, and SynCoal is a registered trademark of the Rosebud SynCoal Partnership. These marks are so identified when the products are identified initially, but for readability
Reducing Waste in Data Center Network Upgrades
"... Fundamental limitations of traditional data center network architectures have led to the development of architectures that provide enormous bisection bandwidth for up to hundreds of thousands of servers. To implement any of these solutions, a legacy data center operator usually must replace most swi ..."
Abstract
 Add to MetaCart
on bisection bandwidth and using optimal link capacity. We finish by describing an algorithm that finds the minimum cost upgrade path for an existing network to support a given traffic load. 1.
Upgrade Paths for Mopra
"... This paper discusses a series of upgrades for the Mopra millimetrewave telescope which are aimed at maintaining its position as a world class facility for single dish, longwave millimetre astronomy (i.e. 2.6mm < < 12 mm), the premier such facility in the southern hemisphere. In these bands ..."
Abstract
 Add to MetaCart
lie the ground state transitions of most molecules studied in the interstellar medium, as well as the transition from dustdominated to freefree continuum emission from the associated gas. Three enhancements are discussed, of increasing complexity and expense, which provide for an upgrade path
The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost
, 2015
"... The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem by allowing to reduce the cost of at most K arcs. In this paper, we consider complexity and algorithms for the special case of an uncapacitated network with just one source. By ..."
Abstract
 Add to MetaCart
The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem by allowing to reduce the cost of at most K arcs. In this paper, we consider complexity and algorithms for the special case of an uncapacitated network with just one source
UPGRADATION OF
, 2009
"... The proposed center of excellence building in educational and workshop building which is to be upgrated by renovation additional/alteration of existing building at Faridkot151203 State Punjab. This location is at Faridkot151203 the district place. The atmosphere is generally dry and fair. The wor ..."
Abstract
 Add to MetaCart
The proposed center of excellence building in educational and workshop building which is to be upgrated by renovation additional/alteration of existing building at Faridkot151203 State Punjab. This location is at Faridkot151203 the district place. The atmosphere is generally dry and fair. The working season is nearly full year, however the area is seasonal rainfall area. Generally mansoon occurs in July to September, rest of the period is dry and sunny. All the materials and labour required for construction activity are available in near by area. The proposed work is of RCC generally in M20 grade of concrete with open isolated footing as per the loading requirement and structural designs is prepared that will be used in stages as per schedule of construction where additional construction is involved The general specification of construction are shown in drawing of with this tender form. the drawings are tentative, the execution drawings will be provided in stages as per schedule of construction. The all materials required for construction should be got approved from the engineer in charge well in advance before procurement on site.
Results 1  10
of
514,429