Results 1  10
of
14,842
ALGORITHMS FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS
, 1957
"... In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated p ..."
Abstract

Cited by 454 (0 self)
 Add to MetaCart
In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated
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
THE AUCTION ALGORITHM FOR THE TRANSPORTATION PROBLEM
 ANNALS OF OPERATIONS RESEARCH 20(1989)6796 67
, 1989
"... The auction algorithm is a parallel relaxation nictliod for solving the classical assignment problem. It resembles a competitive bidding process whereby unussigncd persons bid simultaneously for objects, thereby raising their prices. Once all bids arc in, objects arc awarded to the highest bidder. T ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
. Tliis paper generalizes the auction:ilgoritliin to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to inodily the auction algorithm to exploit the special structure of this problem. Computational results sliow Ihat
ITCP: Indirect TCP for mobile hosts
, 1995
"... Abstract — IPbased solutions to accommodate mobile hosts within existing internetworks do not address the distinctive features of wireless mobile computing. IPbased transport protocols thus suffer from poor performance when a mobile host communicates with a host on the fixed network. This is cause ..."
Abstract

Cited by 614 (7 self)
 Add to MetaCart
(MSRs) to provide transport layer communication between mobile hosts and hosts on the fixed network. With ITCP, the problems related to mobility and the unreliability of wireless link are handled entirely within the wireless link; the TCP/IP software on the fixed hosts is not modified. Using I
A DelayTolerant Network Architecture for Challenged Internets
, 2003
"... The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme env ..."
Abstract

Cited by 953 (12 self)
 Add to MetaCart
The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 762 (27 self)
 Add to MetaCart
gle computers, through small clusters of computers, to data centers with thousands of computers. The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer
Monopolistic competition and optimum product diversity. The American Economic Review,
, 1977
"... The basic issue concerning production in welfare economics is whether a market solution will yield the socially optimum kinds and quantities of commodities. It is well known that problems can arise for three broad reasons: distributive justice; external effects; and scale economies. This paper is c ..."
Abstract

Cited by 1911 (5 self)
 Add to MetaCart
The basic issue concerning production in welfare economics is whether a market solution will yield the socially optimum kinds and quantities of commodities. It is well known that problems can arise for three broad reasons: distributive justice; external effects; and scale economies. This paper
he FixedCharge Transportation Problem
"... On approximation of the fully fuzzy xed charge transportation problem ..."
he FixedCharge Transportation Problem
"... On approximation of the fully fuzzy xed charge transportation problem ..."
THE TWOSTEP TRANSPORTATION PROBLEM
, 2008
"... An algorithm is developed from the associated generator trees of basic dual solution of a twostep transportation problem. This is completely appropriate for the ”Balinski signature method”. In this way we obtain prime solution for the twostep transportation problem. Key words: transportation, 2st ..."
Abstract
 Add to MetaCart
An algorithm is developed from the associated generator trees of basic dual solution of a twostep transportation problem. This is completely appropriate for the ”Balinski signature method”. In this way we obtain prime solution for the twostep transportation problem. Key words: transportation, 2
Results 1  10
of
14,842