When dynamic network exhibits extremely complex behavior and keeps on changing all the time, the energy efficiency is the most important key-point of routing algorithm. Many empirical measurements are inadequate to represent dynamic networks. However, the quotient space theory is an in-depth treatment of hierarchical problem solving, and powerful abilities of representation with different granu...

This paper presents several methodological and algorithmic improvements over a state-ofthe-art dynamic programming algorithm for solving the bi-objective {0, 1} knapsack problem. The variants proposed make use of new definitions of lower and upper bounds, which allow a large number of states to be discarded. The computation of these bounds are based on the application of dichotomic search, defi...

the aim of this paper is to present an efficient method for a rail freight car fleet sizing problem. this problem is modeled mathematically as a multi-period, dynamic and multi-objective, in which the rail freight wagons are assumed to be heterogeneous. demands for different wagons and all travel times are assumed deterministic. in order to increase the utilization of the available wagons in th...

In this paper, a bi-objective model is presented for dynamic and integrated network design of a new entrant competitive closed-loop supply chain. To consider dynamism and integration in the network design problem, multiple long-term periods are regarded during planning horizon, so that each long-term period includes several short-term periods. Furthermore, a chain to chain competition between t...

We introduce the pseudoflow algorithm for the maximum-flow problem that employs only pseudoflows and does not generate flows explicitly. The algorithm solves directly a problem equivalent to the minimum-cut problem—the maximum blocking-cut problem. Once the maximum blocking-cut solution is available, the additional complexity required to find the respective maximum-flow is O m logn . A variant ...

Parallelizing sparse simplex algorithms is one of the most challenging problems. Because of very sparse matrices and very heavy communication, the ratio of computation to communication is extremely low. It becomes necessary to carefully select parallel algorithms , partitioning patterns, and communication optimization to achieve a speedup. Two implementations on Intel hypercubes are presented i...

In this paper, we show that the parametric simplex method is an efficient algorithm for solving various statistical learning problems that can be written as linear programs parametrized by a so-called regularization parameter. The parametric simplex method offers significant advantages over other methods: (1) it finds the complete solution path for all values of the regularization parameter by ...

With the rapid development of information technology, demand of network & information security has increased. People enjoy many benefits by virtue of information technology. At the same time network security has become the important challenge, but network information security has become a top priority. In the field of authentication, dynamic password technology has gained users’ trust and favor...

The application of complex network theory can clearly reveal the coopetition activities between inter-members in software industrial virtual cluster. The research result shows that neither simplex cooperation nor competition,but it is a kind of dynamic equilibrium of coopetition. The empirical is analyzed by using the example of cloud computing. In the process of coopetition evolution, the dist...