integer programming problem 中文意思是什麼

integer programming problem 解釋
整數規劃問題
  • integer : n. 1. 【數學】整數 （opp. fraction）。2. 完整的東西，整體。
  • programming : 編程序的
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. 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

    為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。
  2. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  3. Prof. xue. y ( 2002 ) proposed a general optimization framework for the coordination, where the task is formulated as a nonlinear hybrid - programming problem with both integer and continuous variables and with numerous stability constraints

    當前預防控制和緊急控制已被置於同一個優化過程和相應的協調優化框架，建立了統一研究的優化模型。
  4. 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 ）相似的客戶分組思想，通過徑?環切割法把整個配送區域劃分成多個客戶子集，實現客戶分組並確定服務整個配送區域的最佳車輛數目。在客戶分組的基礎上建立了精簡路線的整數模型，然後通過運用兩條基於實際經驗的判斷來進一步減少巡迴路線數目，進而極大地減少了整數規劃的變量規模，並利用專業的求解軟體來求解該整數規劃問題，從而確定計劃期的庫存補充計劃。
  5. The problem is addressed through mathematical programming approach, the linear integer formulation is developed for optimizing the network throughput, and then the similarity between the original problem and the graph edge coloring problem is shown through the conflict graph concept. a column generation solution is proposed and several enhancements are made in order to fasten its convergence. numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes

    一個對tdma機制的有效改進方法是空分tdma機制，它將無線結點之間的物理距離考慮在內，規定互相不干擾的通訊鏈路可以在相同的時間片內傳輸，從而減少了網路所需時間片的總量，從而提高了單位時間內可傳輸數據包的數量，即提高了整個網路的吞吐量throughput 。
  6. 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

    根據煉油生產調度得到的油品調合比例，結合產品庫存和出廠計劃，對成品油的調合問題進行了描述。並分別以廠內罐區和碼頭罐區為對象，提出了成品油儲運調度的混合整數規劃模型，從而解決了成品油調合、存儲和移動等一系列問題，為成品油罐區的管理提供了技術支持。
  7. 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來滿足快速調整布局方案的要求.與以前的以單元為中心的演算法不同，演算法基於單元行劃分來進行單元的插入和位置調整，在此過程中使對原布局方案的影響最小，並且盡可能優化線長.一組從美國工業界的測試例子表明，該演算法運行速度快，調整后的布局效果好
  8. Chaos genetic algorithm method for a class of nonlinear bilevel mixed integer - programming problem

    基於混沌遺傳演算法的一類非線性兩層混合整數規劃問題求解
  9. A mixed integer programming formulation for the off - line version of the problem has been proposed

    給出了問題的數學描述，並對其靜態問題，構造了一個混合整數規劃模型。
  10. Because the second math model belongs to nonlinear programming problem, we adapted generic algorithm. at last generic algorithm is well compared with integer programming algorithm in method step and method principle

    對模型二，因為是一個非線性規劃問題，故可採用遺傳演算法求解，並詳細介紹了兩種求解演算法的步驟，原理，以及這兩個模型間的異同點和優缺點。
  11. The key idea is to model the leakage current reduction problem as a mixed - integer linear programming ( mlp ) problem in order to simultaneously place and size the sleep transistors optimally

    該方法的核心是利用混合整數線性規劃方法同時確定插入細粒度休眠晶體管的位置和尺寸。
  12. When problem scale is small, we can adopt many classical algorithms such as linear programming integer programming, branch and bound method to solve this problem

    當問題規模較小時，可用線性規劃、整數規劃、動態規劃等經典演算法求解。
  13. However, signals take effect by the switch of signal phases, which introduces integer control values into the traffic control problem, so the traffic control problem becomes a large - scale mixed integer programming problem, the computation of which requires an exponential - complexity optimiz ation algorithm

    但是，信號燈通過相位切換對交叉口進行控制，同時也在交通控制模型中引入了整數決策變量，使交通控制模型成為一個大規模混合整數規劃問題，需要指數復雜度的優化演算法。
  14. To solve the problem of exponential space in the instruction - set automated design for the application specific instruction set processor ( asip ), a formular clustering integer linear programming model ( cim ) is proposed, which can decrease the exploration space effectively utilizing function dependencies between instructions

    摘要提出集束式整數線性規劃形式化模型，利用指令間的功能依賴性解決專用指令集處理器中指令集自動定製的指數性空間問題。
  15. Many problems of engineering and system are integer or mixed integer programming problems. lt is well known that the problem of integer programming is a np - hard problem, and the method for it is exponential complex

    工程、系統問題中有許多問題屬于整數或混合整數規劃問題。眾所周知，線性整數規劃問題是np - hard問題，求解該問題的精確解演算法具有指數復雜性。
  16. The model is formulated as a non - linear integer - programming problem. it ' s a np - hard problem, and it ' s hard to be resolved

    從模型的形式上看，該模型屬于運籌學領域中的非線性0 - 1整數規劃問題，在理論界屬于np - hard問題，求解起來很困難。
  17. In the process of developing " the dss of army waterway transportation " an 0 - 1 integer linearity programming model of ' ' choosing ships " problem is established. the model has more than 100 variables so the traditional approaches are incapable

    0 - 1規劃是一種重要的整數線性規劃模型，本文在實際開發「部隊水路輸送決策支持系統」的過程中，對選擇可用船問題建立了0 - 1規劃模型。
  18. An integer nonlinear programming approach optimizing cutting stock problem

    整數非線性規劃方法優化下料問題
  19. The extended max - rwa problem is formulated as two integer linear programming ( ilp ) from the different viewpoint, and then solved using genetic algorithm and tabu - search algorithm respectively. a dynamic routing and wavelength assignment algorithm ( lcwa ) for limited - range wavelength conversions is proposed

    從不同角度出發，給出了max - rwa問題的兩個整數線性規劃模型，隨後分別使用遺傳演算法和禁忌搜索演算法求解了波長轉換范圍受限條件下的靜態max - rwa問題。
分享友人
分享到 Line

分享到臉書