Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
This paper develops a general solution framework based on aggregation techniques to solve NP-Hard problems that can be formulated as a circulation model with specific side constraints. The size of the extended Mixed Integer Linear Programming formulation is generally pseudo-polynomial. To efficientl...
Main Author: | |
---|---|
Other Authors: | , , , |
Format: | article |
Language: | eng |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/53060 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/53060 |