Graphs, Algorithms, and Optimization Donald L. Kreher, William Kocay
Publisher: Chapman and Hall/CRC

Graphs, Algorithms, and Optimization. Several optimization problems become simpler in bipartite graphs. So today I'm going to just discuss optimizing the algorithm, not a low level implementation but rather the some of the high level issues. These algorithms were based on clever use of the homomorphic properties of random projections of the graph's adjacency matrix. I could use A*, but that seems optimized for pathfinding. One such algorithm is the maximum weight matching algorithm in which prices are optimized iteratively to find an assignment that maximizes net benefit in the bipartite graph. Tabu Search to Solve Real-Life Combinatorial Optimization Problems: a Case of Study.- Reformulations in Mathematical Programming: A Computational Approach.- Graph-based Local Elimination Algorithms in Discrete Optimization? Psuedocode, english descriptions, and actual code are all great. Download Graphs, Algorithms, and Optimization. Well it depends on your implementation and your navigational graph. Graphs, Algorithms, and Optimization Donald L.