Stars
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem
An exact algorithm for difficult and high coordinate Euclidean max-sum diversity problems
An exact algorithm for Euclidean max-sum optimisation problems
UESTC Thesis Latex Template. It fully supports the latest format specification since 2023, supports independent symbol table, abbreviation table, and complete and fully customizable Academic/Profes…
Winning Solver of PACE Challenge 2019 Track A
📄 适合中文的简历模板收集（LaTeX，HTML/JS and so on）由 @hoochanlon 维护
AAAI 2024 Papers: Explore a comprehensive collection of innovative research papers presented at one of the premier artificial intelligence conferences. Seamlessly integrate code implementations for…
This is the working repository for the CSDP project. CSDP is a solver for semidefinite programming problems. It is a COIN-OR project.
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem
Wei Z, Hao J K. Iterated hyperplane search for the budgeted maximum coverage problem[J]. Expert Systems with Applications, 2023, 214: 119078.
Maximum independent sets and vertex covers of large sparse graphs.
Source code for example programs from Lord of the io_uring guide
Event-driven network library for multi-threaded Linux server in C++11
A collection of algorithms used for any-angle pathfinding with visualisations.
An exact algorithm for the edge weighted maximum clique problem
A C++ header-only HTTP/HTTPS server and client library
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
geoVeRoPy: Geometrical Vehicle Routing Problems solved by Python