MOWCATL 算法的源程序代码，使用 c + +

根据汽车零部件供应商、汽车生产企业仓库不同的地理位置、汽车零部件供应商不同的供给数量，建立数学模型，提出两阶段法求解VRP问题，第一阶段，运用改进的k-means聚类算法对整个汽车零部件供应商区域进行统一的划分，将区域划分成多个单元子区域；第二阶段对同一区域的汽车零部件供应商点进行线路规划，本文采用蚁群算法进行求解，并对蚁群算法进行改进，实现高效率、低成本、优服务的目标；最后通过matlab编程求解。

数据挖掘是信息产业界近年来非常热门的研究方向，聚类分析是数据挖掘中的核心技术。本文对数据挖掘领域的聚类分析方法及代表算法进行分析，并从多个方面对这些算法性能进行比较，同时还对聚类分析在数据挖掘中的几个应用进行了阐述。-Data Mining is the IT industry is very popular in recent years the direction of the research, cluster analysis is data mining in the core technology. In this paper, the field of data mining methods and the representative of cluster analysis algorithm analysis, and from several aspects of these algorithms to compare the performance, but also on the cluster analysis of data mining in several applications are described.

适用于坐标转换，利用高斯投影正算反算坐标在北京54西安80以及cgcs2000下的坐标系，可以实现坐标系的换带等。对于测绘和地理信息上图幅纠正等，是最基础的条件。

约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.

给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum total value of the goods but a subset of the W capacity. Dynamic Programming

对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种周游，输出三种周游的结果。- To wilfully assigns two forks the tree (to go against points from to decide) establishes it two to fork the chain table storage structure, and (sets at spatial stack after the stack five kind of fundamental operations, enters stack, sends out of the warehouse, takes stack top element, sentences stack to be spatial) realizes two forks the tree first the foreword, center the foreword, the foreword three kinds travels around, outputs the result which three kinds travels around.

请注意一个凸函数的域是由数据流凸 set.can 等效地对被核查 设置 S0。这尤其是具有重大的现实意义

三维场景优化加载,用opengl 实现，涉及四叉树分割, LOD  l以及块与块之间裂缝的修补，等等  窥探三维场景四叉树加载的入门例子

资源描述本代码是数据结构dfs算法的一个例子，用C++编程，程序员输入由o和#组成的阵列，算法实现找出阵列中以#为单位的整体形成多少个十字型，相邻的#组成一个整体（上下左右为相邻，斜对角不算）。

mathematic