您要查找的是不是：
- The only general solution is linear or integer programming. 唯一通行的解決方法是線(xiàn)性規劃或者整數規劃。
- A mixed integer programming formulation for the off-line version of the problem has been proposed. 給出了問(wèn)題的數學(xué)描述，并對其靜態(tài)問(wèn)題，構造了一個(gè)混合整數規劃模型。
- To general 0-1 Integer Programming Problem problem, we present a semi-roboticized DNA computing model. 摘要對一般的0-1整數規劃問(wèn)題提出了一種半自動(dòng)化的DNA計算模型。
- The integer programming algorithm in this paper is proved very efficient natty examples. 列舉多個(gè)算例，對這些算例進(jìn)行比較表明，所提出的整數規劃算法非常有效。
- Convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming. 凸分析、拉格朗日松弛法、不可微分函數最適化以及在整數規劃上的應用。
- This paper formulates the satellite imaging scheduling problem as a 0-1 integer programming model,which is NP complete. 建立了衛星成像調度問(wèn)題的0-1整數規劃模型,該問(wèn)題具有NP完全特性。
- The paper uses integer programming to research repositioning of intermodal empty container of land-carriage . 摘要 本文應用整數規劃的方法研究了集裝箱陸上空箱多式聯(lián)運調運優(yōu)化問(wèn)題。
- The approximate algorithm of a nonliear bilevel integer programming for global optimization was disscussed. 討論了一類(lèi)非線(xiàn)性?xún)杉壵麛狄巹澣謨?yōu)化的求解問(wèn)題。
- Finally, compared with the CGA and classical integer programming (IP), the efficiency of fCGA is shown by the simulation results. 最后,根據生產(chǎn)實(shí)踐中得到的數據進(jìn)行了仿真,通過(guò)壓縮遺傳算法和整數規劃方法的比較,驗證了快速壓縮遺傳算法在解決多目標優(yōu)化問(wèn)題上的有效性。
- The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. 求解最小生成樹(shù)的方法雖然很多,但是利用LINGO建立相應的整數規劃模型是一種新的嘗試。
- The combination explosion problem is common in solving 0-1 integer programming with enumeration and implicit enumeration ways. 用窮舉法和隱枚舉法解0-1型整數規劃問(wèn)題時(shí),常常遇到組合爆炸問(wèn)題。
- The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization. 使用迭代的啟發(fā)式最優(yōu)化算法來(lái)解決多例學(xué)習中復雜的整型規劃問(wèn)題，以使分類(lèi)風(fēng)險最小化。
- The optimal solution of this integer programming model is derived by Lingo 5.0.And the distribution scheme of the first 30 clients is given. 以會(huì )員的最大滿(mǎn)意度為目標函數，建立一個(gè)整數規劃模型，得到問(wèn)題的分配方案，并計算出前30位會(huì )員的分配結果。
- Be inspired from natural plant growth,this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming. 從大自然植物生長(cháng)中得到啟發(fā),提出了一種求解非線(xiàn)性整數規劃全局最小解的仿生算法。
- Integrate the ABCM and Mixed Integer programming to advance a Multi-Products Operations Decisions Model.Thereafter optimize the ABC calculation. 綜合運用作業(yè)成本法和混合整數規劃法，提出了多品種生產(chǎn)決策模型，并對作業(yè)成本計算法進(jìn)行了改善優(yōu)化。
- Unit commitment (UC) is a large scale, multi-constraint and nonlinear hybrid integer programming problem.Particle swarm optimization is a stochastic global optimization technique. 摘要機組組合優(yōu)化問(wèn)題是一個(gè)大規模、多約束、非線(xiàn)性的混合整數規劃問(wèn)題，因此求解非常困難。
- The problem is formulated as a mixed integer programming and an corresponding algorithm is put forward,which first planed location,and then planed resources allocation,and solv. 針對該問(wèn)題構建了混合整數規劃模型,提出了一種先進(jìn)行選址然后進(jìn)行資源分配的優(yōu)化算法。
- By using the quadratic integer programming method, the problem about the maximal edge number of a graph with a fixed vertex-neighbor-integrity is studied. 摘要本文用二次整數規劃法研究給定鄰域完整度的圖可能具有的最大邊數問(wèn)題。
- Considering the relationship between customer satisfaction and enterprise profit, a 0-1 mix integer programming model is proposed in echelon supply chain. 基于客戶(hù)滿(mǎn)意度和企業(yè)利潤這對矛盾，建立了一個(gè)層級供應鏈0-1混合整數規劃模型。
- In this dissertation, the RWA problem is modeled as an integer programming problem, the discrete variables are about the selection of links and wavelength assignment. （三）對于沒(méi)有安全或有安全約束的機組優(yōu)化調度問(wèn)題，不管是否考慮爬升約束機組發(fā)電功率重新經(jīng)濟分配的情形，都給出了求解經(jīng)濟分配的相應線(xiàn)性規劃模型：凸組合系數方法和功率增量方法，證明了它們與原始非線(xiàn)性經(jīng)濟分配問(wèn)題的等價(jià)性；
