Convergent Lagrangian heuristics for nonlinear minimum cost network flows.
Torbjörn LarssonJohan MarklundCaroline OlssonMichael PatrikssonPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- minimum cost
- network flow
- np hard
- network flow problem
- approximation algorithms
- capacity constraints
- min cost
- network simplex algorithm
- spanning tree
- search algorithm
- optimal solution
- heuristic search
- edit operations
- lagrangian relaxation
- network flow formulation
- integer programming
- minimum cost flow
- similarity measure
- evolutionary algorithm
- social network analysis
- scheduling problem
- special case
- objective function