Results 141 to 150 of about 381 (184)

A long-step barrier method for convex quadratic programming.

Anstreicher, K.M., Roos, C., Hertog, D. den, Terlaky, T.   +3 more
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Multicommodity Flows in Ring Networks

INFORMS Journal on Computing, 1996
In this paper, we consider the problem of multicommodity flows in a ring network. Using necessary and sufficient conditions to ensure feasible linear and integral flows in the network, and the special structure of the ring topology, we construct efficient algorithms to route all the demands.
Rita Vachani, Alexander Shulman, Peter Kubat, Julie Ward   +3 more
exaly   +2 more sources

Hypercubes and Multicommodity Flows

SIAM Journal on Discrete Mathematics, 1997
Summary: The average degree of a subgraph \(H\) of the \(r\)-dimensional hypercube \(Q_r\) equals at most the maximum Hamming distance of any two nodes in \(H\). A corollary is that the minimum number of edges to delete from \(Q_r\) such that any two nodes at Hamming distance \(\ell\) are separated is \((r+1-\ell) 2^{r-1}\).
Bo Yu 0001, Joseph Cheriyan, Penny E. Haxell   +2 more
exaly   +3 more sources

On the max-flow min-cut ratio for directed multicommodity flows

Theoretical Computer Science, 2006
We present a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of the greedy algorithm for the ...
Tom Leighton
exaly   +2 more sources

- Multicommodity Flows

, 2016
openaire   +2 more sources

The stochastic multicommodity flow problem

Networks, 1990
AbstractThis paper formulates and classifies some multicommodity flow problems (MFP) on “stochastic networks.” Here, the arc attributes are not necessarily deterministic, but, rather, are allowed to be probabilistic. Some special cases of the stochastic multicommodity flow problems (SMFP) are considered where the resultant formulations are solvable by ...
Hossein Soroush, Pitu B. Mirchandani
openaire   +1 more source

Approximation through multicommodity flow

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 2002
The first approximate max-flow-min-cut theorem for general multicommodity flow is proved. It is used to obtain approximation algorithms for minimum deletion of clauses of a 2-CNF identical to formula, via minimization problems, and other problems. Also presented are approximation algorithms for chordalization of a graph and for register sufficiency ...
Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao   +3 more
openaire   +1 more source

A multicommodity flow problem

Networks, 1974
AbstractThis paper presents an algorithm for finding maximal sized sets of flows in a certain class of multicommodity flow networks. The class consists of networks with integer capacity edges and with each node being a source or sink for all but at most one commodity.
openaire   +2 more sources

Multicommodity network flows—A survey

Networks, 1978
AbstractThis report aims at a comprehensive survey of the literature dealing with the multicommodity flow problem. This problem arises naturally in network modelling wherever commodities, vehicles, or messages are to be shipped or transmitted from certain nodes of an underlying network to some others.
openaire   +2 more sources

Multicommodity Network Flows with Safety Considerations

Operations Research, 1992
Previous research on the multicommodity minimum cost flow problem (MMCFP) has assumed that there are two types of values associated with an arc. The first is the capacity of the arc and the second is the unit flow cost along the arc. This paper adds the third attribute—the degree of difficulty—into the conventional model of the MMCFP.
Y. L. Chen, Y. H. Chin
openaire   +2 more sources