A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory.
Jean-Claude PicardMaurice QueyrannePublished in: Networks (1982)
Keyphrases
- network flow
- graph theory
- nonlinear programming problems
- minimum cost
- integer programming
- linear programming
- social network analysis
- optimality conditions
- min cost
- integer program
- optimization model
- network flow formulation
- complex networks
- bipartite graph
- np hard
- graph based representations
- linear program
- pairwise
- optimal solution