摘要: This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two ...
Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...
This contribution is part of the special series of Inaugural Articles by members of the National Academy of Sciences elected in 2021.
Uncertainties are widespread in the optimization of process systems, such as uncertainties in process technologies, prices, and customer demands. In this paper, we review the basic concepts and recent ...
In this work, a new method is presented for determining the binding constraints of a general linear maximization problem. The new method uses only objective function values at points which are ...
Polyploid organisms carry more than two copies of each chromosome, a condition rarely tolerated in animals but which occurs relatively frequently in the plant kingdom. One of the principal challenges ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results