C++实现的稀疏矩阵类,可实现稀疏矩阵的存储计算等功能-Now, instead of using 2D, we will use doubly-linked lists to present sparse matrices. There are various methods of organizing doubly-linked-lists. We not only store elements of sparse matrices but also implement operations

子集树回溯法 试设计一个用回溯法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。 装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。-A subset of the trial design of a backtracking tree with backtracking search a subs

Bigamp算法仿真程序，用于5G下MIMO的低分辨率ADC的设计、分析等。-The User s Guide has very little right now. There is a reference to one example, but I am hoping to find more. Also, due to a server error we are trying to debug, the webpage may time several minutes to

For this project I implemented a parallel formulation for the Traveling Salesman Problem (TSP). The TSP is a NP-hard problem in combinatorial optimization. Given a list of cities with their pairwise distance, the task is to find the shortest route th