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...

Full description

Saved in:
Bibliographic Details
Published inComputational Logistics Vol. 9335; pp. 328 - 342
Main Authors Haugland, Dag, Hendrix, Eligius M. T.
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2015
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text

Cover

Loading…