integer programming 中文意思是什麼
-
Some research work for integer programming has been done by now, but less for integer nonlinear programming, and little has been done to it by initiatory method
對純整數非線性規劃問題目前已有一些工作，對非線性混合整數規劃問題的工作較少，用啟發式演算法解決混合整數非線性規劃問題的工作也不多見。 -
Ant colony optimization algorithm for nonlinear integer programming
非線性整數規劃的蟻群演算法 -
The topics covered in this course include : unconstrained optimization methods, constrained optimization methods, convex analysis, lagrangian relaxation, nondifferentiable optimization, and applications in integer programming
這門課程的主題包括：無限制最適化方法，限制最適化方法，凸分析，拉格朗日鬆弛法，不可微分函數最適化，以及在整數規劃上的應用。 -
In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered at each replenishment
此外，為達到極小化總訂購成本及總持有成本，本模型?用混合整?規劃技巧提供一個簡單求解方法，可同時求得最佳訂購次? 、訂購點及每次訂購? ? 。 -
A method of penalty function for solving nonlinear mixed integer programming
非線性混合整數規劃的罰函數解法 -
A method of non - linear penalty function for solving integer programming and mixed integer programming
一種求解整數規劃與混合整數規劃非線性罰函數方法 -
Integer programming of circular chromatic number
計算圓色數的混合整數規劃方法 -
Then, with respect to the objective of minimizing the total experimental cost, the optimal test plan ( including the sample size, inspection frequency, and the termination time needed by the classification rule for each of competing designs ) is derived by solving a nonlinear integer programming with a minimum probability of correct classification and a maximum probability of misclassification
首先，我們提出一種具直觀優點的分?法則，然後以總試驗成本的最小化為目標，並賦予一正確分?的最小機?要求和錯誤分?的最大容許機? ?個限制條件，以決定出在所提出的分?法則下，各競標設計樣式所需的樣本? 、 ?測頻?和試驗終止時間的最佳組合。 -
Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed
為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。 -
Investigation of quantitative, decision - making techniques available to management. topics include linear programming, integer programming, game theory, simulation, queuing theory, networking, project management, inventory control
本課程旨在研究量化與決策技術在管理的應用。課程內容包括線性規劃、數理規劃、競賽理論、模擬程序、排隊理論、網路建立、項目管理及庫存控制理論。 -
Investigation of quantitative, decision - making techniques available to management. topics include linear programming, integer programming, game theory, simulation, queuing theory, networking, project management, and inventory control
本課程旨在研究量化與決策技術在管理的應用。課程內容包括線性規劃、數理規劃、競賽理論、模擬程序、排隊理論、網路建立、項目管理及庫存控制理論。 -
Neighborhood integer point search method to solve integer programming
鄰域整點搜索法求解整數規劃 -
Based on the modified house of quality, the chance - constrained programming model is developed to determine the optimal striving targets by stochastic simulation and genetic algorithm, and the 0 - 1 integer programming model is derived for the decision - making of reengineering objectives
基於改進的質量屋建立了機會約束規劃模型，通過隨機類比和遺傳演算法確定最佳奮斗目標；建立了0 - 1整數規劃模型，用於經營過程重構目標的決策。 -
Secondly, in the first phase, this paper solves the inventory supplement sub - problem through integer programming model, using the reduction of vehicle routes as the breakthrough to this problem, divides a whole distribution region into many customer subsets by radius - circle partitioning method, determines the optimal number of vehicle of service distribution region, applies two practice - oriented conclusions to reduce the number of routes on the basis of customer grouping, thus decreases considerably the variable scale of integer programming, and solves the problem through professional software to fix inventory supplement plan in plan period
其次，在第一階段使用整數規劃數學模型來規劃庫存補充計劃子問題，以減少車輛巡迴路線數目為求解該整數規劃的突破口，提出與固定劃分策略（ fpp ）相似的客戶分組思想，通過徑?環切割法把整個配送區域劃分成多個客戶子集，實現客戶分組並確定服務整個配送區域的最佳車輛數目。在客戶分組的基礎上建立了精簡路線的整數模型，然後通過運用兩條基於實際經驗的判斷來進一步減少巡迴路線數目，進而極大地減少了整數規劃的變量規模，並利用專業的求解軟體來求解該整數規劃問題，從而確定計劃期的庫存補充計劃。 -
With the blending ratio calculated from production scheduling, a mixed integer programming model of oil storage and transfer scheduling is proposed based on the oil inventory and output planning, the problem of oil storage both in the port tank and in the refinery tank are solved, the results can be used for the oil management
根據煉油生產調度得到的油品調合比例，結合產品庫存和出廠計劃，對成品油的調合問題進行了描述。並分別以廠內罐區和碼頭罐區為對象，提出了成品油儲運調度的混合整數規劃模型，從而解決了成品油調合、存儲和移動等一系列問題，為成品油罐區的管理提供了技術支持。 -
Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years. others are heuristic methods like genetic algorithm
近年來求解選址模型用得較多的數學優化方法有分支定界法、混合整數規劃法、運輸模型法、可分離線性規劃法。 -
It improves on preventing the switching control process from oscillation and refusing compensation. the other is optimal switching control of the multi - tap capacitors formulated by nonlinear hybrid integer programming model
為了實現全局優化控制，本文將一個非線性混合整數規劃優化控制模型逐次線性化成增量形式后求解，即逐次線性規劃法。 -
Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically. this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do. an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength. test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調整布局方案的要求.與以前的以單元為中心的演算法不同，演算法基於單元行劃分來進行單元的插入和位置調整，在此過程中使對原布局方案的影響最小，並且盡可能優化線長.一組從美國工業界的測試例子表明，該演算法運行速度快，調整后的布局效果好 -
The paper discussed a method combining integer programming based on similarity coefficient with quadratic programming considering ratio of capacity to loading in workshop to obtain parts families and machines groups in two steps
摘要採用了基於相似系數的整數規劃和考慮車間資源負荷分配比率的二次規劃相結合的方法，分兩步得到了零件族和設備組。 -
Evaluation of enterprise ' s credit risk based on mixed integer programming approach
基於混合整數規劃法的企業信用風險評估研究
分享友人