ZhangGe6/heuristic-algorithms-for-solving-knapsack-and-uniform-graph-partitioning-problem ZhangGe6/heuristic-algorithms-for-solving-knapsack-and-uniform-graph-partitioning-problem

  • Stars
    star
    2
  • Language
    Python
  • Created over 3 years ago
  • Updated 8 months ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
ZhangGe6/heuristic-algorithms-for-solving-knapsack-and-uniform-graph-partitioning-problem
github

ZhangGe6

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Simulated Annealing and Tanbu algorithm, to solve knapsack and uniform graph partitioning problems, respectively.

More Repositories

1

onnx-modifier

A tool to modify ONNX models in a visualization fashion, based on Netron and Flask.
JavaScript
1,268
star
2

sports_counting_by_pose_estimation

An android demo for real-time single person sports counting. It is based on MoveNet and deployed with ncnn.
C++
44
star
3

GestureDet

A gesture recognition module trained from scratch using Pytorch, deployed with ncnn and TensorRT.
Jupyter Notebook
10
star
4

ZhangGe6.github.io

Shell
3
star
5

how-to-optimize-playground

High-performance computing (HPC) demos since I was a freshmen.
C
3
star
6

netron-hierarchy

View DL models in a hierarchical fashion.
JavaScript
2
star
7

progressBarAdder

A simple tool to add progress bar for .gif file.
Python
2
star