物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes
標(biāo)簽： location location-allocation Continuous alternate
上傳時間： 2015-05-17
上傳用戶：kikye
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the Shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
標(biāo)簽： Traveling Salesman solution Problem
上傳時間： 2013-12-22
上傳用戶：ruixue198909
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the Shortest path (least distance needed to travel to each city exactly once)
標(biāo)簽： Traveling Salesman solution Problem
上傳時間： 2013-12-04
上傳用戶：從此走出陰霾
第一章：Internetworking 第二章：Internet Protocols 第三章：IP Subnetting and Variable Length Subnet Masks(VLSM) 第四章：Introduction to the Cisco IOS 第五章：IP路由 第六章：Enhanced IGRP(EIGRP) and Open Shortest Path First(OSPF) 第七章：Layer 2 Switching 第八章：Virtual LANs(VLANs) 第九章：Managing a Cisco Interwork 第十章：Managing Traffic with Access Lists 第十一章：Wide Area Networking Protocols
標(biāo)簽： Internetworking Subnetting Protocols Internet
上傳時間： 2014-01-05
上傳用戶：qiao8960
java Labyrinth game；Provides two kinds to produce map s way stochastically: The stochastic distribution point method and the chart depth first traversal the law two kinds.It can searches the Shortest way to demonstrate automatically
標(biāo)簽： stochastically stochastic Labyrinth distribut
上傳時間： 2016-06-13
上傳用戶：qilin
OSPF是一種路由選擇協(xié)議。路由選擇算法和路由選擇協(xié)議在概念上是不同的。網(wǎng)絡(luò)上的主機(jī)、路由器通過路由選擇算法形成路由表，以確定發(fā)送分組的傳輸路徑。而路由選擇協(xié)議是路由器用來建立路由表和更新路由信息的通信協(xié)議。 開放最短路徑優(yōu)先協(xié)議(Open Shortest Path First，OSPF)是目前最主要的內(nèi)部網(wǎng)關(guān)協(xié)議之一。通過本課程設(shè)計，學(xué)生可以對路由表的建立和路由信息的更新等有更直觀和清晰的認(rèn)識。
標(biāo)簽： 路由選擇 OSPF 協(xié)議 算法
上傳時間： 2014-01-04
上傳用戶：笨小孩
matlab最短路的貪心算法，用VC++實現(xiàn)，把Shortest.dll復(fù)制到matlab工作文件夾運行（先要運行mex-setup，關(guān)聯(lián)VC與MATLAB）調(diào)用方法如 a = [-1,2,3 2,-1,4 3,4,-1] ShorstEst(a) 即可
上傳時間： 2013-12-10
上傳用戶：cxl274287265
This program sets up EVA Timer 1, EVA Timer 2, EVB Timer 3 and EVB Timer 4 to fire an interrupt on a period overflow. A count is kept each time each interrupt passes through the interrupt service routine. EVA Timer 1 has the Shortest period while EVB Timer4 has the longest period.
標(biāo)簽： Timer EVA EVB interrupt
上傳時間： 2013-12-25
上傳用戶：康郎
C++圖論算法，dijistra Shortest path， floyd Shortest path等最短路算法
上傳時間： 2014-01-03
上傳用戶：笨小孩
迷宮算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the Shortest path, only need to find one path that gets * you to desitination. */
標(biāo)簽： Starting point means maze
上傳時間： 2013-12-27
上傳用戶：Divine
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
