搜索资源列表
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell commodities, the known distance
TSPSourceCode
- C#语言编写的基于遗传算法的旅行销售员问题的源程序-C# language based on the genetic algorithm travel to sell the source
TSP
- 旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after
expr2
- 旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance bet
五金仓库进、销、存管理系统
- VFP的五金仓库进、销、存管理系统-VFP metal into warehouses, sell and deposit management system
huffman-C
- 基于huffman算法的压缩/解压缩的程序源码。 Borland C++写的。 仅供参考学习，请勿作为盈利性程序。-Huffman compression code compressor and decompressor in Borland C++ 2.0 by Shaun Case, April 1991 Enclosed in this archive are two C programs that implement Huffman code compressi
MyTicketSale
- 现在需要全国联网销售火车票，全国代销点很多，为了保证数据库的安全，要求使用Web Service提供接口的方式实现，完成车票查询功能-National network now needs to sell train tickets across the country to sell a lot of points, in order to ensure database security, require the use of Web Service interfaces provide me
juzhen
- 设某物质有m个产地，n个销地，如果以 aij 表示由第 i 个产地销往第 j 个销地的数量，则这类物质的调运方案，可用一个数表表示如下-M has established a substance of origin, n sell, if in order to express AIJ i个origin from the first sold to the first j months of quantity sold, then the transport of such substances
ex2
- 旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-Traveling salesman problem to a salesman to sell a number of city merchandise, known distance between each city (or travel). Him to select a departure from the resi
antD
- 旅行商问题：某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-Traveling salesman problem: a number of sales going to the city to sell goods, known distance between cities (or passage). He selected one from a resident, goes throug
4
- 已知在文件IN.DAT中存有100个产品销售记录，每个产品销售记录由产品代码dm(字符型4位)，产品名称mc(字符型10位)，单价dj(整型)，数量sl(整型)，金额je(长整型)五部分组成。其中：金额=单价*数量计算得出。函数ReadDat()是读取这100个销售记录并存入结构数组sell中。请编制函数SortDat()，其功能要求： 按产品名称从小到大进行排列，若产品名称相等，则按金额从小到大进行排列，最终排列结果仍存入结构数组sell中，最后调用函数WriteDat()把结果输出
ChenBenZhiXing
- 将总金额分若干分，分批在各档位建仓，通过高抛低吸不断降低成本获利-The total amount will be divided into several sub-batches in the stalls position is opened by throwing buy low, sell high profit continuously reduce costs
program
- 基于遗传算法的旅行商问题求解 旅行商问题：假设有一个推销员，要到 n 个城市推销商品，他要找出一个包含所有 n 个城市的具有最小开销的环路-Traveling Salesman Problem Based on Genetic Algorithm for Traveling Salesman Problem: Suppose a salesman, to sell goods to the n cities, he has to find a city that contains all n
oneTSP
- TSP问题的动态规划法 某售货员要到若干城市去推销商品，已知各城市之间的路程(或旅费)。他要选定一条从驻地出发，经过每个城市一次，最后回到驻地的路线，使总的路程(或总旅费)最小。-TSP problem of dynamic programming to a number of cities to a salesman to sell goods, known distance between cities (or travel). He selected a departure from th
mlzzdzjxt
- clips专家系统的麦粒肿诊断专家系统设计与实现-CLIPS License Information Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restricti
sell
- 输入数据的第一行为两个正整数M（M<=1000），N（N<=30），分别表示王伯的资金和鱼的种类。以下N行，每行有两个正整数S（1<=S<=N），T，分别表示某种鱼的编号以及该鱼的价格。 接着，每行有两个整数P，Q。当P，Q均大于0时，表示P，Q不能共处；当P，Q均等于0时，表示输入的结束。 Output 输出数据的第一行为两个正整数X，Y，分别表示所买鱼的条数和总花费。以下X行，每行有一个正整数，表示所买鱼的编号。编号按升序排列输出。 如果题目有多个解，
MyAnalysisiofTestResult
- 画出时间序列的价格图，以及描上相应的买卖点和依据自己指标定义的最佳入市/退市点-plot the time series figure and scatter the respective sell/buy point
1-ETS
- 问题陈述：有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。-Problem Statement: a salesman, n (n < = 10) cities want to sell products. Before departure in order to save travel expenses, he find out the cost of travel
Genetic-algorithm---TSP
- 基于MATLAB的遗传算法的旅行商（TSP）问题求解，TSP问题：有一个推销员，要到n个城市推销商品，他要找出一个包含所有n个城市的具有最短路程的环路。-Solving based MATLAB genetic algorithm traveling salesman problem (TSP), TSP problem: a salesman to sell goods to the n cities, he wants to find the one that contains all th
MARVIN-NON-REPAINT-Buy-Sell-Signal
- MARVIN NON-REPAINT Buy Sell Signal