Applications of the Dulmage-Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement.
Cleve AshcraftJoseph W. H. LiuPublished in: SIAM J. Matrix Anal. Appl. (1998)
Keyphrases
- network flow
- network flow formulation
- bipartite graph
- minimum cost
- linear programming
- integer programming
- capacity constraints
- graph model
- network flow problem
- vertex set
- traffic control
- graph structure
- min cost
- optimization model
- directed graph
- random walk
- spanning tree
- undirected graph
- weighted graph
- set cover
- reinforcement learning
- random graphs
- search space
- genetic algorithm
- np hard
- particle swarm optimization