Master Chief's repositories

election-fraud-national

Compares the voter turnout vs. age curves from various states.

Language:PythonStargazers:1Issues:2Issues:0

forward-k-opt

Lin-Kernighan-style k-opt TSP solver that uses a quad tree for dynamic search. Only "forward swaps" (a subset of typical LK moves) are implemented.

Language:C++Stargazers:1Issues:4Issues:0

lkhq

A Lin-Kernighan-Helsgaun-style TSP solver, with quadtrees for efficiency.

Language:C++Stargazers:1Issues:2Issues:0
Stargazers:0Issues:0Issues:0
Stargazers:0Issues:2Issues:0
Language:PythonStargazers:0Issues:2Issues:0
Language:PythonStargazers:0Issues:0Issues:0
Language:PythonStargazers:0Issues:0Issues:0
Language:PythonStargazers:0Issues:2Issues:0
Language:PythonStargazers:0Issues:2Issues:0

election-fraud-ohio

Manually reproducible proof of voter fraud in the state of Ohio.

Language:PythonStargazers:0Issues:2Issues:0
Language:PythonStargazers:0Issues:2Issues:0

election-fraud-pennsylvania

Proof of voting machine fraud in Pennsylvania by exposing the relationship between voter turnout and age.

Language:PythonStargazers:0Issues:2Issues:0
Stargazers:0Issues:2Issues:0

lkl

Lin-Kernighan-Lee: a Lin-Kernighan-style TSP solver with a quadtree-based dynamic candidate set.

Language:C++Stargazers:0Issues:2Issues:0

multicopter-print

OpenSCAD implementation of a multicopter. Configurable design.

Language:OpenSCADStargazers:0Issues:2Issues:0

point-quadtree

C++ implementation of a quadtree that holds points.

Language:C++Stargazers:0Issues:2Issues:0
Language:OpenSCADLicense:MITStargazers:0Issues:2Issues:0

segment-builder

Python test implementation for discerning line segments in images.

Stargazers:0Issues:2Issues:0

segment-quadtree

c++ implementation of a quadtree that holds line segments.

Language:C++Stargazers:0Issues:2Issues:0
Stargazers:0Issues:2Issues:0

tsp-fast-2-opt-geo

Fast 2-Opt TSP solver for geographic (lat, lon) instances. Uses the google S2 library to improve efficiency.

Stargazers:0Issues:2Issues:0

tsp-min-ch

A construction heuristic (CH) that tries to introduce minimally-sized edges first.

Language:C++Stargazers:0Issues:2Issues:0

tsp-mst-2d

Creates a minimum spanning tree in the style of Kruskal, but using a quadtree to improve efficiency.

Stargazers:0Issues:2Issues:0

tsp-mst-naive

Standard minimum spanning tree for TSP instances implemented in python. Meant for experimentation and visualization of small instances.

Language:PythonStargazers:0Issues:2Issues:0

tsp-mst-opt

An experimental tsp solver utilizing MSTs as a base for specialized k-opt moves.

Stargazers:0Issues:2Issues:0

tsp-mst-plotter

Plots TSP tours and MST graphs.

Stargazers:0Issues:0Issues:0

tsp-python

Monorepo for Euclidean, symmetric Traveling Salesman Problem solvers written in Python.

Language:PythonLicense:MITStargazers:0Issues:0Issues:0

tsp-tour-inflation

Utility to add points into a tour that do not increase overall tour length. Intended for tour perturbation in local optimization schemes.

Stargazers:0Issues:2Issues:0