On a Pooling Problem with Fixed Network Size
The computational challenge offered by most traditional network flow models is modest, and large scale instances can be solved fast. The challenge becomes more serious if the composition of the flow has to be taken into account. This is in particular true for the pooling problem, where the relative...
Saved in:
Published in | Computational Logistics Vol. 9335; pp. 328 - 342 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2015
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!