In finite graphs, greedy algorithms are used to find minimum spanning trees (MinST) and
maximum spanning trees (MaxST). In infinite graphs, we illustrate a general class of …

Infinite-horizon nonstationary Markov decision processes (MDPs) extend their stationary
counterparts by allowing temporal variations in immediate costs and transition probabilities …

We discuss finding minimum spanning trees (MSTs) on connected graphs with countably
many nodes of finite degree. When edge costs are summable and an MST exists (which is …

Given the costs and a feasible solution for a minimum cost flow problem on a countably
infinite network, inverse optimization involves finding new costs that are close to the original …

In this work, we contribute a parallel implementation of the network simplex algorithm that is
used for the solution of minimum cost flow problem. In the network simplex algorithm, finding …

We study a class of countably infinite linear programs (CILPs) whose feasible sets are
bounded subsets of appropriately defined spaces of measures. The optimal value, optimal …

We introduce a simplex method for general countably infinite linear programs. Previous
literature has focused on special cases, such as infinite network flow problems or Markov …

Modern transportation relies heavily on fossil fuels. However, fossil fuel consumption
endangers our world. According to the Intergovernmental Panel on Climate Change,[14] …

Network flows is an active area of research that has applications in a wide variety of fields.
Several network flow problems are reduced to either the maximum flow problem or the …

We develop novel dual-ascent and primal-dual methods to solve infinite-horizon
nonstationary deterministic dynamic programs. These methods are finitely implementable …