Results 261 to 270 of about 6,623,538 (310)
Some of the next articles are maybe not open access.
Flow symmetry and algebraic flows
ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research, 1993Lovász showed that a vector \(x\) defined on the arc set of a directed network \(D\) is a circulation iff for each pair of distinct vertices \(s\) and \(t\) the value of a maximum \((s,t)\)-flow in \(D\) with respect to capacities \(x\) equals the value of a maximum \((t,s)\)-flow in \(D\) with capacities \(x\) (``flow-symmetry''). In this paper, it is
Mark E. Hartmann, Michael H. Schneider
openaire +1 more source
Estimation of flows in flow networks
European Journal of Operational Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ron Zohar, Dan Geiger
openaire +1 more source
MINIMUM FLOW VARIATION IN MAXIMUM FLOWS
Discrete Mathematics, Algorithms and Applications, 2010Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost.
M. Masoumi +2 more
openaire +2 more sources
Job Flows, Worker Flows, and Churning
Journal of Labor Economics, 2000We utilize a large employer‐level panel dataset to explore the links between gross job flows and gross worker flows. Our findings have relevance for models of job creation and job destruction, and labor reallocation. We find churning flows (the difference between worker and job flows at the level of the employer) to be high, pervasive, and highly ...
Burgess, SM, Lane, J, Stevens, D
openaire +3 more sources
Mathematical Programming, 1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
IEEE Computer Graphics and Applications, 2011
This installment looks at the work of Brenda Molloy, who creates art based on digital imagery.
openaire +3 more sources
This installment looks at the work of Brenda Molloy, who creates art based on digital imagery.
openaire +3 more sources
"River Flow, Sewer Flow, Street Flow
Transfers, 2012River Flow, Sewer Flow, Street Flow is a location-based, interactive mobile soundscape originally presented in Old Montreal at DHC-ART1 as part of the exhibition Lost Rivers: La Petite St. Pierre. The exhibition took up mobility as a curatorial challenge and featured videos and photographs by underground explorer Andrew Emond and sound compositions by ...
Kim Sawchuk, Samuel Thulin
openaire +1 more source
Manufacturing Engineer, 1992
When output isn't what it should be, and the losses are piling up, it is easy to look at the internal workings of the factory for the answer. But what about external influences? Vic Lilley explains.
openaire +1 more source
When output isn't what it should be, and the losses are piling up, it is easy to look at the internal workings of the factory for the answer. But what about external influences? Vic Lilley explains.
openaire +1 more source
1987
Self-sufficient models of the flow of funds go beyond the constraints of simple identities. One type developed by Stone (1966) is a “financial input-output” model. Programming models are a closely related class. A third category can be described as a model of circular flow.
openaire +1 more source
Self-sufficient models of the flow of funds go beyond the constraints of simple identities. One type developed by Stone (1966) is a “financial input-output” model. Programming models are a closely related class. A third category can be described as a model of circular flow.
openaire +1 more source