Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.
François ClautiauxSaïd HanafiRita MacedoMarie-Emilie VogeCláudio AlvesPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- network flow
- dynamic programming
- probabilistic model
- learning algorithm
- computational complexity
- search space
- np hard
- objective function
- optimization algorithm
- optimal solution
- cost function
- worst case
- social networks
- particle swarm optimization
- genetic algorithm
- minimal cost
- capacity constraints
- network flow problem