MATHPROG

Computational Geometry

Computational Number Theory

Linear Programming

Matching

Maximum Flow

Minimum Cost Flow

Minimum Cuts

Miscellaneous network optimization codes

Non-linear Optimization

Polytopes and Polyhedra

Semide-definite Programming

Solving optimization problems via the Web

Tools and Libraries

References to other optimization resources


MATHPROG
Solver for the Maximum Weight Matching Problem

See H. Gabow: Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs, Ph.D. thesis, Stanford University, 1973, for information on algorithm.
weighted-match.tar   All-in-one download file

readme General information on program by author E. Rothberg
double.a awk-command file used in edge_to_cm
edge_to_wm UNIX shell script for converting matching problems in DIMACS format to Rothberg's format described in input.form
glib.c Source code for manipulating graph data structure
graphtypes.h Definition of graph data types and macros
input.form Description of input format
main.c Main C executor
makefile UNIX makefile for producing excecutable wmatch
match.defs Definition of macros and global variables
match_c_shell UNIX shell archive containing all required files
output.form Description of output format
pairs.c Functions for generating matching by pairs of vertices
pointer.c Functions for processing vertex links
readgraph.c Functions for initializing graph data structure
strip.c awk-command file used in edge_to_cm
term.c Functions used to produce final matching
test.in Small test example
unpairs.c Functions for restructuring matching by pairs of vertices
wmatch.c Source code implementing Gabow's algorithm

Last update: November 17, 1999 Georg Skorobohatyj ZIB Homepage


URL: http://elib.zib.de/pub/Packages/mathprog/matching/weighted/index.html