Search - COST 2

Search - COST 2 - List

[Windows Develop] 旅行售货员问题 DL : 0: 旅行售货员问题的解是一棵排列树．在给出的图中寻找一条费用最优的回路-travel salesman problem is the solution with a tree. The plan is to find an optimal cost of the Loop
Date : 2025-12-25 Size : 2kb User : 姚翊
[Windows Develop] 全国交通咨询系统 DL : 0: 一　题目全国铁路交通咨询系统二　需求分析 1.系统配制：硬件：CPU：P4 1.6G 内存容量 256M 标准输入输出设备软件：操作系统Windows xp 源程序调试工具VC6.0 可执行文件运行工具 DOS 5.0. 2.该系统有供用户选择的菜单和交互性。 3.建立一个全国铁路交通咨询系统，该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。三　设计概要 1.抽象数据类型本程序运用了关于图这种数据结构。他的抽象数据类型定义如下： typedef struct unDiGraph { int numVerts //结点 costAdj cost //邻接矩阵 }unDiGraph,*UNG 基本操作： unDiGraph* CreateCostG() 操作结果：构造带权(费用)图。 unDiGraph* CreateTimeG() 操作结果：构造带权（时间）图。 PathMat *Floyed(unDiGraph *D) 操作结果：Floyed函数求任意两点的最短路径。 -a subject of the national railway traffic advisory system analysis of a two needs. Preparation System : Hardware : CPU : P4 1.6 GHz 256 MB of memory standard input and output device software : Windows XP operating system source code debugging tools VC6.0 executable file running DOS 5 tools. 0. 2. The system is available for users to choose the menu and interactive. 3. The establishment of a national rail traffic advisory system, the system automatically search with arbitrary two inter-city rail traffic and the shortest path to the function at the lowest cost. Three design an outline. This abstract data type procedures on the use of this data structure map. His abstract data type is defined as follows : typedef struct (int unDiGraph numVerts// node costAdj cost// adjacency matrix) unDiG
Date : 2025-12-25 Size : 55kb User : gang
[Windows Develop] leasttree DL : 0: 输入无向图的邻接矩阵，使用前面讲过的任意三种方法求该图的最小代价生成树，并分析各自的时间复杂度。-Enter the undirected graph of adjacency matrix, said in front of the arbitrary use of three methods for the minimum cost spanning tree graph, and analyze their time complexity.
Date : 2025-12-25 Size : 3kb User : 张建鑫
[Windows Develop] GUANLIPR DL : 0: 管理程序的应用，用于计算管理的项目所需要的费用。-Application of management procedures, used to calculate the management cost of the project.
Date : 2025-12-25 Size : 1kb User : 唐俊峰
[Windows Develop] SuccessiveShortest DL : 0: 最小费用流的最小费用路算法SuccessiveShortest-Minimum cost flow of minimum cost path algorithm SuccessiveShortest
Date : 2025-12-25 Size : 2kb User : 叶博
[Windows Develop] CycleCanceling DL : 0: 网络优化算法：最小费用流的消圈算法cyclecanceling-Network Optimization Algorithms: Minimum Cost Flow Algorithm circle of extinction cyclecanceling
Date : 2025-12-25 Size : 2kb User : 叶博
[Windows Develop] jxcbook_Data DL : 0: Information is an indispensable part for any company who wants to increase their competitiveness in the fierce market competition. Inventory management, which will help a company to reduce cost and increase profit, has become one of the most important parts when using the ERP system.
Date : 2025-12-25 Size : 136kb User : 哦
[Windows Develop] sdf DL : 0: 最小生成树的数据结构解法，若要在n个城市之间建设通信网络，只需要架设n－1条线路即可。如何以最低的经济代价建设这个通信网-Minimum spanning tree method of data structure, to cities in the n-building communications between the network only need to set up n-1 lines to. How to minimize the economic cost of building the communications network
Date : 2025-12-25 Size : 3kb User : yang
[Windows Develop] tingchechangguanli DL : 0: 停车场管理系统！数据结构作业。有较强的界面操作功能。能查看车场信息，车辆离开时，给出显示应缴纳的费用！-Car park management system! Data structure operations. There is a strong function of the interface operation. Able to view the car information, the vehicle was leaving, the show should be given to pay the cost!
Date : 2025-12-25 Size : 1kb User : zhangguifa
[Windows Develop] Telephone_Billing DL : 0: 电话计费系统，具有以下功能：计费功能。根据存放在源数据文件中的通话记录和长途费率文件对每一条通话记录计算其通话费用，并将结果保存在费用文件中。话费查询。输入一个电话号码，从费用文件中统计该电话号码的所有本地话费、长途话费，并从用户文件中查找其用户名。话单查询。输入一个电话号码，查询并在屏幕显示该用户的所有通话记录-Telephone billing system, has the following functions: billing functions. According to the source data files stored in the long distance call records and document the rate of a call record for each call to calculate their costs, and the results stored in the cost of document. Inquiry calls. Enter a phone number, statistics from the cost of paper all the phone numbers of local calls, long distance calls, and documents from the user to find their user name. If a single query. Enter a phone number, query and display all the user' s phone records
Date : 2025-12-25 Size : 3kb User : liuchen
[Windows Develop] cost-based DL : 0: a cost based algortihm for travelling salesman problem
Date : 2025-12-25 Size : 25kb User : sadi
[Windows Develop] multiphufman DL : 0: 多元Huffman编码变形问题描述：在一个操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定在合并过程中最多可以有m(k)次选k 堆石子合并成新的一堆，2≤k≤n，合并的费用为新的一堆的石子数。试设计一个算法，计算出将n 堆石子合并成一堆的最小总费用。数据输入：由文件input.txt 提供输入数据。文件的第1 行有1 个正整数n，表示有n 堆石子。第2行有n个数，分别表示每堆石子的个数。第3行有n-1 个数，分别表示m(k)（2≤k≤n）的值。 -Deformation of multi-Huffman Encoding Description: In a playground are placed around the rock n heap. Stone is to have the order to merge into a pile. The provisions of the merger process can have up to m (k) election k heap of stones into a pile of new, 2 ≤ k ≤ n, the combined cost of the stone pile of the new number. Try to design an algorithm to calculate the n heap a pile of stones into the smallest total cost. Data entry: input.txt documents provided by the input data. Line 1 of the document there is a positive integer n, that there are n piled stones. No. 2 there are n number of lines, respectively, said the number of stones in each pile. Line 3 has the number of n-1, respectively, m (k) (2 ≤ k ≤ n) values.
Date : 2025-12-25 Size : 54kb User : seabird
[Windows Develop] depot DL : 0: 仓库选址问题算法，在公路上选择一个位置xp建立仓库，使得仓库为超市供货的总费用最小。-Warehouse location problem algorithm, select a location on the highway xp setting up a warehouse, allowing warehouse supermarket minimize the total cost of supply.
Date : 2025-12-25 Size : 1kb User : lqt1
[Windows Develop] OR DL : 0: This contains the programs in c++ (KHRUSHAL, PRIMS, LEAST COST, VOGALS)
Date : 2025-12-25 Size : 4kb User : raghu
[Windows Develop] rwzx DL : 0: 工作分配问题。设有n件工作要分配给n个人去完成。将工作i分配给第j个人所需要的费用为Cij。设计一个算法，为每一个人都分配1件不同的工作，并使总费用达到最小。-Work allocation. With n pieces of work should be assigned to the n individual to complete. Will be allocated to the first j of work i need to cost individual Cij. Design an algorithm for each individual is assigned a different work, and to minimize the total cost of
Date : 2025-12-25 Size : 1kb User : 孙云
[Windows Develop] KRUSKAL DL : 0: This an implementation of Kruskal s algorithm. This program finds minimum cost using Kruskal algorithm.-This is an implementation of Kruskal s algorithm. This program finds minimum cost using Kruskal algorithm.
Date : 2025-12-25 Size : 1kb User : Binoy
[Windows Develop] 2 DL : 0: 问题描述：给定n个石子，其重量为a1,a2...,an,要求将其划分为m堆，每一份划分的费用定义为这堆石头中最大重量与最小重量的差的平方。总划分费用等于各堆费用之和。输入：n m 及a1,a2...,an 输出：sum 问题描述：给定n个石子，其重量为a1,a2...,an,要求将其划分为m堆，每一份划分的费用定义为这堆石头中最大重量与最小重量的差的平方。总划分费用等于各堆费用之和。输入：n m 及a1,a2...,an 输出：sum -Description of the problem: Given n-stones, the weight of a1, a2 ..., an, requests that it be divided into m heap, the cost of each division is defined as the weight of this pile of stone, the largest and the smallest weight of the square of the difference . Divide the total cost is equal to the cost of each stack and the. Input: nm and a1, a2 ..., an output: sum description of the problem: Given n-stones, the weight of a1, a2 ..., an, requests that it be divided into m piles, each division of the cost of is defined as the weight of this pile of stone, the largest and the smallest weight of the square of the difference. Divide the total cost is equal to the cost of each stack and the. Input: nm and a1, a2 ..., an output: sum
Date : 2025-12-25 Size : 15kb User : Adler.C
[Windows Develop] 2 DL : 0: 最小费用最大流 C语言编程，运筹学 C语言最小费用最大流-Minimum Cost Flow C language programming, operations research
Date : 2025-12-25 Size : 1kb User : aoxue
[Windows Develop] 200751112499982_136Z_Com DL : 0: 在Winsock i/o 模型中CPIO无疑是性能最好的，当然高性能是耗费系统可观的资源作代价的，在多连接和高数据吞吐率方面要求高的应用中才会用此模型，所以我认为不要盲目地使用此模型。在具体应用中只要继承此类然后重写其中的几个虚函数即可，要注意的几点是：1，CPIO用到多线称，所以对有些资源必须同步2，在数据收发当中会平凡分配和释放内存资源，这种平凡的资源分配和释放回消耗系统一定的资源，所以可以用一种方法尽量减少这种操作，此类中用到了“内存池“-In the Winsock i/o model CPIO is undoubtedly the best performance, of course, is the cost high-performance system, the cost of considerable resources, in many aspects of connectivity and high data throughput applications that require high will use this model, so I Do not blindly believe that using this model. In specific applications such as long as the inheritance and then override a few virtual functions which can be, points to note are: 1, CPIO use multi-line said, so some resources must be synchronized 2, which would be unusual in the data transceiver allocate and free memory resources, this extraordinary resource allocation and released back consume some resources, so you can minimize this with a ways of minimizing the operation of this class are depleted, " Neicun pool"
Date : 2025-12-25 Size : 6kb User : xiaofeng
[Windows Develop] 2 DL : 0: 给定一个N*N 的方形网格，设其左上角为起点◎，坐标为（1，1），X轴向右为正，Y轴向下为正，每个方格边长为1。一辆汽车从起点◎出发驶向右下角终点▲，其坐标为（N，N）。在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则：（1）汽车只能沿网格边行驶，装满油后能行驶K 条网格边。出发时汽车已装满油，在起点与终点处不设油库。（2）当汽车行驶经过一条网格边时，若其X 坐标或Y 坐标减小，则应付费用B，否则免付费用。（3）汽车在行驶过程中遇油库则应加满油并付加油费用A。（4）在需要时可在网格点处增设油库，并付增设油库费用C（不含加油费用A）。（5）(1)～(4)中的各数N、K、A、B、C均为正整数。编程任务：求汽车从起点出发到达终点的一条所付费用最少的行驶路线。数据输入：第一行是N，K，A，B，C的值，2 <=N<=100，2<=K<=10。第二行起是一个N*N 的0-1方阵，每行N 个值，至N+1行结束。方阵的第i 行第j 列处的值为1 表示在网格交叉点（i，j）处设置了一个油库，为0 时表示未设油库。各行相邻的2 个数以空格分隔。结果输出: 第1 行中的数是最小费用值。 -Given an N* N square grid, set the upper left corner as a starting point ◎, coordinates (1,1), X-axis to the right is positive, Y axis, is positive, each square side length of 1. Starting a car approached from the lower right corner of the end point ◎ ▲, its coordinates (N, N). In a number of grid intersection points, set the oil tanks, fuel for vehicles in a moving way. Vehicle in motion the process should follow the following rules: (1) car can only travel along the grid edges, filled with oil can travel after the K edge of the grid. Starting when the car has been filled with oil, not in the starting and ending at the depot is located. (2) when the vehicle is traveling through a mesh edge, if the X coordinate or Y coordinate decreases, then the fees payable B, or toll-free use. (3) the process of moving car in case of fuel oil tanks should fill up and pay the cost of A. (4) when needed at additional grid point depot, depot and pay the additional cost of C (excluding fuel costs A)
Date : 2025-12-25 Size : 1kb User : 张开

« 12 3 4 »