Inimum network problem and its time - based polynomial algorithm 最小網(wǎng)絡(luò)問題及其多項式時間算法
A polynomial time algorithm in positive define geometric programming with constraints 約束正定式幾何規(guī)劃的一種多項式時間算法
A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs 一個求外平面圖最小反饋點(diǎn)集的多項式時間算法
The solution method of the model is testified to be polynomial arithmetic and can fulfils real - time demand in battle 該模型的解法被證明是多項式時間算法,滿足作戰(zhàn)實時性要求。
This paper presents a infeasible interior - point primal - dual affine scaling algorithm for linear programming . it is shown that the method is polynomial - time algorithm 摘要本文對線性規(guī)劃提出了一個不可行內(nèi)點(diǎn)原始對偶仿射尺度算法,并證明了算法是一個多項式時間算法。