Here is a list of all related documentation pages:

2-opt for Traveling Salesman Problem
Bounded-Degree Minimum Spanning Tree
Budgeted Maximum Coverage
Capacitated Facility Location
Combinatorial Auctions
Components
2k-1 Approximate Vertex-Vertex Distance Oracle
Facility Location
Fractional Winner Determination in MUCA
Frequent-directions
Generalised Assignment
Iterative Rounding
K-center
Minimum K-Cut
k-means clustering
k-means clustering engine
K-Median
Knapsack Definition
Knapsack Dynamic
Knapsack 0/1 FPTAS
Knapsack Greedy
Linear Programming
Local Search
Locality-sensitive hashing nearest neighbors regression
Maximum Coverage
Multiway Cut
Using git repository in paal
Scheduling Jobs
Scheduling Jobs on Identical Parallel Machines
Scheduling Jobs with Deadlines on a Single Machine
Set Cover
Shortest Superstring
Steiner Network
Steiner Tree 1.39 Approximation
Steiner Tree Definition
Steiner Tree Dreyfus Wagner
Steiner Tree Greedy
Steiner Tree 11/6 Approximation
Tree Augmentation
Winner Determination in MUCA
Cycle
Metric
Voronoi
Todo List
Bibliographic References