您要查找的是不是：
- A numerical test on an assignment problem show the efficiency of the method. 通過(guò)一個(gè)指派問(wèn)題說(shuō)明了所提出方法的有效性。
- A new method of solving weapon-target assignment problem is provided. 提出了一種求解武器-目標分配問(wèn)題的新方法。
- Result shows that the Hungarian algorithm is an effective method for solving the assignment problem. 仿真結果表明匈牙利算法對于此類(lèi)多目標分配指派問(wèn)題的求解是十分有效的。
- Routing and wavelength assignment problem is a key problem for WDM optical networks. 摘要路由與波長(cháng)分配問(wèn)題是波分復用光網(wǎng)中的一個(gè)關(guān)鍵問(wèn)題。
- It has been used successfully in many fields, such as TSP, assignment problem, job-shop scheduling and graph coloring. 它的應用已涉及許多領(lǐng)域，如旅行商問(wèn)題、指派問(wèn)題、job-shop調度問(wèn)題、圖著(zhù)色問(wèn)題等等，并且取得了很好的效果。
- Finally, We succeed in solving unbalanced assignment problem with genetic algorithm. 最后采用遺傳算法成功地解決了非平衡指派問(wèn)題。
- We study a multi-project team assignment problem with bidders' externalities.A multi-dimensional mechanism design for the problem is explored. 摘要研究了含有多個(gè)子項目的復雜項目團隊指派的機制設計問(wèn)題，模型考慮了投標者之間存在外部性的情況。
- In this paper, a type of multi-commodity location problem is described, which can be changed assignment problem, so it can be solved simply through Hungarian method. 摘要對一類(lèi)多產(chǎn)品設施選址問(wèn)題進(jìn)行了描述，通過(guò)分析得出該類(lèi)設施選址問(wèn)題可轉化為分配問(wèn)題，從而可通匈牙利法對該設施選址問(wèn)題進(jìn)行簡(jiǎn)便地求解。
- Arrival time has importance for the resolution of billing and room assignment problem, for mail-service complaints, and for occasional police inquiries. 對于計算賬單、分配房間、郵件服務(wù)投訴和偶然的警察搜尋工作，記錄客人到達時(shí)間都有其重要性。
- When solving large scale assignment problem, especially when solving an asymmetrical one or efficiency is critical, Hungarian algorithm is not competent enough. 對于高效求解大規模尤其是人數與任務(wù)數不一致的指派問(wèn)題，匈牙利算法存在一些不足之處。
- An optimization model of weapon-target assignment problem (WTA) is given.Many optimization methods to solve the optimum model and their advantages and shortages are analyzed. 摘要建立了武器-目標分配問(wèn)題的優(yōu)化模型，分析了各種解決此模型的方法的優(yōu)缺點(diǎn)。
- Based on the "first in first out" principle, gate assignment problem is transferred to vertex-coloring problem, and corresponding model is constructed also. 以“先到先服務(wù)”原則為基礎，把停機位分配問(wèn)題轉化為頂點(diǎn)著(zhù)色問(wèn)題，并建立了相應模型。
- The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed. 結合旅行商問(wèn)題、二次指派問(wèn)題以及網(wǎng)絡(luò )路由問(wèn)題等典型組合優(yōu)化問(wèn)題;概述了ACO在靜態(tài)組合最優(yōu)化和動(dòng)態(tài)組合優(yōu)化問(wèn)題中的應用.
- Tang give some counter examples to show that Doror's algorithm is not optimal.S.M.Xiang and G.C.Tang apply an assignment problem to solve such a problem. 項思明和唐國春提出對這類(lèi)問(wèn)題在機器連續加工情形下的一種求解方法，即將排序問(wèn)題化成指派問(wèn)題。
- In previous papers, we established the mathematical model of expert assignment problem, and proposed genetic algorithm and GA using heuristic mutation guide by pheromone to solve EAP. 實(shí)驗證明，遺傳算法是一種可行的途徑，并且信息素指導下的啟發(fā)式變異操作，可以加速算法向最優(yōu)解搜索。
- A new approach is proposed to solve multiobject assignment problems with intervals. 摘要針對具有區間數信息的多目標指派問(wèn)題，給出了一種指派方法。
- This paper uses an immune evolution strategy to solve quadratic assignment problems. 利用一種免疫進(jìn)化策略算法來(lái)求解二次布局問(wèn)題。
- The current status of link capacity assignment problem in Computer communication networks is reviewed. Two heuristic algorithms for dis- crete link capacity assignment are proposed, and are compared with existing algorithms. 本文簡(jiǎn)述了計算機網(wǎng)絡(luò )中的容量分配問(wèn)題及現有的各種解決方法,提出了離散容量分配問(wèn)題的兩個(gè)算法,并同現有算法進(jìn)行了比較。
- The topology of the network may be ring, star or bus. 網(wǎng)絡(luò )的拓撲結構可以是環(huán)形的、星形的或總線(xiàn)形的。
- As one of the latter algorithms, ant colony algorithm has been used to many fields, such as: Traveling Salesman Problem, Quadratic Assignment Problem, Network Routing and Load-Balancing Problem, VLSI Design, etc. 摘要蟻群算法作為一種較新的進(jìn)化類(lèi)方法，目前已經(jīng)在若干領(lǐng)域取得了成功的應用，諸如：旅行商問(wèn)題、二次分配問(wèn)題、通訊網(wǎng)絡(luò )中的路由問(wèn)題以及負載平衡問(wèn)題、大規模集成電路設計等。
