The minimum cost of capacity expansion for time-limited transportation problem on-demand (MCCETLTPD) is to find such a practicable capacity expansion transportation scheme satisfying the time-limited T along with all ...The minimum cost of capacity expansion for time-limited transportation problem on-demand (MCCETLTPD) is to find such a practicable capacity expansion transportation scheme satisfying the time-limited T along with all origins’ supply and all destinations’ demands as well as the expanding cost is minimum. Actually, MCCETLTPD is a balance transportation problem and a variant problem of minimum cost maximum flow problem. In this paper, by creating a mathematical model and constructing a network with lower and upper arc capacities, MCCETLTPD is transformed into searching feasible flow in the constructed network, and consequently, an algorithm MCCETLTPD-A is developed as MCCETLTPD’s solution method basing minimum cost maximum flow algorithm. Computational study validates that the MCCETLTPD-A algorithm is an efficient approach to solving the MCCETLTPD.展开更多
By using the stable t-structure induced by an adjoint pair, we extend several results con- cerning recollements to upper （resp. lower） recollements. These include the fundamental results of Par-shall and Scott on co...By using the stable t-structure induced by an adjoint pair, we extend several results con- cerning recollements to upper （resp. lower） recollements. These include the fundamental results of Par-shall and Scott on comparisons of recollements, Wiedemann＇s result on the global dimension and Hap- pel＇s result on the finitistic dimension, occurring in a recollement （Db（A＇）, Db（A）, Db（A＂）） of bounded derived categories of Artin algebras. We introduce and describe a triangle expansion of a triangulated category and illustrate it by examples.展开更多
文摘The minimum cost of capacity expansion for time-limited transportation problem on-demand (MCCETLTPD) is to find such a practicable capacity expansion transportation scheme satisfying the time-limited T along with all origins’ supply and all destinations’ demands as well as the expanding cost is minimum. Actually, MCCETLTPD is a balance transportation problem and a variant problem of minimum cost maximum flow problem. In this paper, by creating a mathematical model and constructing a network with lower and upper arc capacities, MCCETLTPD is transformed into searching feasible flow in the constructed network, and consequently, an algorithm MCCETLTPD-A is developed as MCCETLTPD’s solution method basing minimum cost maximum flow algorithm. Computational study validates that the MCCETLTPD-A algorithm is an efficient approach to solving the MCCETLTPD.
基金Supported by National Natural Science Foundation of China(Grant Nos.11271251,11431010 and 11571239)
文摘By using the stable t-structure induced by an adjoint pair, we extend several results con- cerning recollements to upper （resp. lower） recollements. These include the fundamental results of Par-shall and Scott on comparisons of recollements, Wiedemann＇s result on the global dimension and Hap- pel＇s result on the finitistic dimension, occurring in a recollement （Db（A＇）, Db（A）, Db（A＂）） of bounded derived categories of Artin algebras. We introduce and describe a triangle expansion of a triangulated category and illustrate it by examples.
