combinatorial problems 中文意思是什麼
-
Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce. it can increase logistic economic benefit and realize logistic rationalization. the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism, the establishment of modem chain of command, the development of its and ec. now, the problem is not only applied to the field of auto transportation, but also to ship avigation communication electricity industry management computer application etc. the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company
對貨運車輛進行調度優化，可以提高物流經濟效益、實現物流科學化。對貨運車輛調度優化理論與方法進行系統研究是物流集約化發展、建立現代調度指揮系統、發展智能交通運輸系統和開展電子商務的基礎。目前，問題的形式已有很大發展，該問題以不僅僅局限於汽車運輸領域，在水運、航空、通訊、電力、工業管理、計算機應用等領域也有一定的應用，其演算法已用於航空乘務員輪班安排、輪船公司運送貨物經過港口與貨物安排的優化設計、交通車線路安排、生產系統中的計劃與控制等多種組合優化問題。 -
This paper studies the approximation algorithms of some combinatorial optimization problems
本文主要研究組合優化中若干問題的近似演算法。 -
Dp technique is a high efficiency algorithm to solve combinatorial optimization problems by divided the multidimensional problem into multiple 1 - dimension problems. when this technique resorts to accumulate multiple frames, there are some disadvantages
動態規劃演算法是一種解決組合尋優問題的高效演算法，通過將n維問題變換為n個一維優化問題，一個一個地求解的方法，很好的提高了效率。 -
An olap cube data set is created with olap techniques base on the labour source dw. some complex problems are solved in some combinatorial conditions. and then, some statistics figs and tables are show
運行olap技術，在勞動力資源數據倉庫的基礎上，建立olap多維數據集，較好地解決比較復雜的組合條件下的查詢分析問題，並可生成直觀的統計圖表。 -
In this disser - tation we discuss two typical problems in the combinatorial geometry mentioned in [ 12 ]. helly ' s theorem plays a very important role in combinatorial geome - try
本文就其中兩類典型問題加以討論：一類是helly型問題和幾何橫截問題，另一類是嵌入與覆蓋問題。 -
The program of state space to solve one combinatorial problem is made up of the general searching module and one module of material problem. the different material problems have different modules, but the general searching module does not vary with the problems
一個組合問題的狀態空間求解程序由通用搜索模塊加上一個問題描述模塊組成，不同問題具有不同的問題描述模塊，通用搜索模塊不隨問題的改變而改變。 -
This problem has vide applications in real areas, such as the design of water and electricity supply networks, and communication networks, etc. at the same time, the problem is also closely related with some classical combinatorial optimization problems, including the steiner problem and the travelling salesman problem, which are well - known. so, it is of great importance to study it
所謂歐幾里德2 -連通steiner網路問題，就是對于給定的平面點集p ，確定它的長度最小的2 -連通steiner網路，該問題與組合最優化中著名的steiner問題和旅行售貨員問題有關，同時在水、電供應網路和通訊網路等設計中也有非常廣泛的應用，所以對該問題的研究具有重要的意義。 -
In the rest of the thesis, we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems. in chapter 2, we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
在第二章至第五章中，我們分別研究了四個組合優化問題的近似演算法，並給出了它們的性能分析。 -
The algorithm is based on the breadth - first search and optimized by ant algorithm. ants system is an artificial system based on the behavior of real ant colonies, which is often used to solve combinatorial problems, such as traveling salesman problem ( tsp ). in ant colony system ( acs ), a set of cooperating agents called ants cooperate to find good solutions to tsp
本演算法基於寬度優先並用螞蟻演算法優化，螞蟻演算法是一種基於真實蟻群的人工智慧系統，常用於解決組合優化問題，如旅行商問題（ tsp ） ，在螞蟻演算法中一組螞蟻團結合作，尋找tsp問題的最優解。 -
7 moses charikar, sudipto guha. improved combinatorial algorithms for the facility location and k - median problems. in focs 99 : proc
在流數據上，我們將k中值點問題簡化為一個流數據上頻繁項搜索問題。 -
Since the development of the simplex method many people have contributed to the growth of linear programming by developing its mathematical theory, devising efficient computational methods and codes, exploring new applications, and by their use of linear programming as an aiding tool for solving more complex problems, for instance, discrete programs, nonlinear programs, combinatorial problems, stochastic programming problems, and problems of optimal control
由於單純形的發展，很多人致力於線性規劃的進步，通過發展它的數學理論、設計高效的計算方法和規則、探索新的應用，以及把線性規劃的使用作為解決更復雜問題的輔助工具，比如，離散規劃，非線性規劃，組合問題，隨機規劃問題和最優控制問題。 -
Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局問題是具有np完備計算復雜度的離散組合優化問題。 -
Faced with the difficult problems in project reality, this paper analyzes advantage and disadvantage and adaptability of the detection method used at present and proposes combinatorial inspection methods of buried steel pipeline detection based on experimental study
從實際檢測工作所面臨的技術難題出發，分析了目前國內外常用的埋地鋼質管道外覆蓋層檢測方法的優缺點及適應性，通過比對試驗研究，提出了埋地管道應將檢測技術組合方法應用於檢測實踐，以促進管道防腐工作的開展。 -
Adleman, l. m. " molecular computation of solutions to combinatorial problems. " science 266 ( 5187 ) ( 11 nov 1994 ) : 1021 - 4
組合問題的分子運算解決方法. " 。期刊科學第266卷。第1024到1024頁。 -
Problem c and problem d are also dual. they have a dual property that there are at least three " critical points " corresponding to an optimal straight - line in problem c and there are at least three " critical straight - lines " corre - sponding to an optimal point in problem d. from these properties, these four non - linear prob - lems could be transformed into combinatorial problems and could be solved by algorithms with polynomial - time iterations
問題c和問題d也是對偶問題。問題c和問題d也有很好的對偶性質：在問題c中，對應於一條最優直線，至少存在三個「臨界點」 ；在問題d中，對應於一個最優點，至少存在三條「臨界直線」 。基於這種性質，這四個非線性優化問題便轉化為組合問題，從而得到迭代次數為多項式的演算法。 -
Until now, this type of combinatorial problems are usually solved by linear programming, interger programming, analytical methods, heuristic methods and so on. but these methods have many disadvantages such as. low searching efficiency, converging slowly, converging to local optimization solution easily and not converging
本文針對目前對接入網優化存在著缺乏有效演算法的現狀，確定了採用高效的啟發式搜索演算法? ?遺傳演算法作為優化演算法，著重解決了遺傳運算元的設計和實現問題，並對演算法進行了改進，取得了很好的效果。 -
The engineering backgrounds of this dissertation are layout design of the national spacecraft modules that our institute undertakes and the cooperative development work of crawler crane quy150 with xuzhou construction machinery group inc. the difficulties of solving complex engineering layout problems lie in computational complexity ( combinatorial explosion will occur. )
本文研究基於計算智能和人機交互的設計理論、方法及其在工程系統布局方案設計中的應用，其工程背景是課題組承擔的我國航天器艙的布局方案設計和為徐州工程機械集團開發的履帶式起重機quy150的相關布局設計問題。求解復雜工程布局問題的難點是存在計算復雜性的組合爆炸和工程實用化的復雜性。 -
A novel algorithm and its convergence for a class of combinatorial optimization problems
一類組合優化問題的新解法及其收斂性 -
Recently, genetic algorithm has been tyied to resolve variable combinatorial optimization problems, such as job scheduling problem, but but has began just now in vsp
近些年來，人們在用遺傳演算法解決現實中的各種組合優化問題上進行了探索，如在生產調度問題中的應用，但在車輛調度問題中的應用才剛剛開始。 -
Formal development of several algorithms for combinatorial mathematics problems
形式化開發若干組合數學問題的演算法
分享友人