The wheel speed control problem of an automotive powertrain equipped with a conventional spark-ignition engine directly connected to a continuously variable transmission (CVT) and an electronic throttle is considered. We revisit the seminal work by Guzzella and Schmid and show that the control structure that dedicates the throttle actuator to maintaining engine operation at the maximum fuel eff...

let $r$ be a commutative ring with zero-divisor set $z(r)$. the total graph of $r$, denoted by$t(gamma(r))$, is the simple (undirected) graph with vertex set  $r$ where two distinct vertices areadjacent if their sum lies in $z(r)$.this work considers minimum zero-sum $k$-flows for $t(gamma(r))$.both for $vert rvert$ even and the case when $vert rvert$ is odd and $z(g)$ is an ideal of $r$it is s...

Ford and Fulkerson’s original 1956 max flow/min cut paper formulated max flow in terms of flows on paths, rather than the more familiar flows on arcs. In 1974 Hoffman pointed out that Ford and Fulkerson’s original proof was quite abstract, and applied to a wide range of flow problems. In this abstract model we have capacitated elements, and linearly ordered subsets of elements called paths. Whe...

The problem of connectivity is an extremely important one in the context of massive graphs. In many large communication networks, social networks and other graphs, it is desirable to determine the minimum-cut between any pair of nodes. The problem is well solved in the classical literature, since it is related to the maximum-flow problem, which is efficiently solvable. However, large graphs may...

in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

This paper investigates the minimum cost multicommodity flow problem with uncertain costs and uncertain capacities. Uncertainty theory is used to deal with indeterminacy factors in uncertain network. An (α, β)-minimum cost multicommodity flow model is formulated. Some properties of the model are analyzed. An equivalence relationship between the (α, β)-minimum cost multicommodity flow and the mi...