|
關(guān)注：1
2013-05-23 12:21
求翻譯：Then an optimal schedule can be found in polynomial time by transforming the scheduling problem into an equivalent asymmetric traveling salesman problem that satisfies the so-called Demidenko conditions [36]是什么意思？ 待解決
 懸賞分：1
- 離問(wèn)題結(jié)束還有
Then an optimal schedule can be found in polynomial time by transforming the scheduling problem into an equivalent asymmetric traveling salesman problem that satisfies the so-called Demidenko conditions [36]
問(wèn)題補(bǔ)充： |
|
2013-05-23 12:21:38
然后優(yōu)化調(diào)度可以在多項(xiàng)式時(shí)間調(diào)度問(wèn)題轉(zhuǎn)化為等效的非對(duì)稱(chēng)旅行商問(wèn)題，滿(mǎn)足的所謂的demidenko條件[36]
|
|
2013-05-23 12:23:18
然后找到一個(gè)最佳計(jì)劃可以在多項(xiàng)式時(shí)間的安排問(wèn)題,轉(zhuǎn)變成為一個(gè)相當(dāng)于非對(duì)稱(chēng)旅行推銷(xiāo)員問(wèn)題,以滿(mǎn)足所謂demidenko條件[36]
|
|
2013-05-23 12:24:58
然后優(yōu)選的日程表在多項(xiàng)時(shí)間可以被發(fā)現(xiàn)通過(guò)變換預(yù)定的問(wèn)題成滿(mǎn)足所謂的Demidenko適應(yīng)的一個(gè)等效不對(duì)稱(chēng)的旅游推銷(xiāo)商問(wèn)題(36)
|
|
2013-05-23 12:26:38
然后可以在多項(xiàng)式時(shí)間內(nèi)發(fā)現(xiàn)一個(gè)最優(yōu)的計(jì)劃，通過(guò)將調(diào)度問(wèn)題轉(zhuǎn)換為等效的不對(duì)稱(chēng)貨郎擔(dān)問(wèn)題，滿(mǎn)足了所謂的杰米堅(jiān)科條件 [36]
|
|
2013-05-23 12:28:18
然后一份優(yōu)化的時(shí)間表可以通過(guò)將安排問(wèn)題轉(zhuǎn)化成滿(mǎn)足所謂的 Demidenko 條件的一個(gè)對(duì)應(yīng)不對(duì)稱(chēng)的旅行推銷(xiāo)員問(wèn)題在多項(xiàng)式的時(shí)間被找到 (36)
|
湖北省互聯(lián)網(wǎng)違法和不良信息舉報(bào)平臺(tái) | 網(wǎng)上有害信息舉報(bào)專(zhuān)區(qū) | 電信詐騙舉報(bào)專(zhuān)區(qū) | 涉歷史虛無(wú)主義有害信息舉報(bào)專(zhuān)區(qū) | 涉企侵權(quán)舉報(bào)專(zhuān)區(qū)
