A simplex algorithm for minimum-cost network-flow problems in infinite networks

Thomas C. Sharkey, H. Edwin Romeijn. A simplex algorithm for minimum-cost network-flow problems in infinite networks. Networks, 52(1):14-31, 2008. [doi]

@article{SharkeyR08,
  title = {A simplex algorithm for minimum-cost network-flow problems in infinite networks},
  author = {Thomas C. Sharkey and H. Edwin Romeijn},
  year = {2008},
  doi = {10.1002/net.20221},
  url = {http://dx.doi.org/10.1002/net.20221},
  tags = {data-flow, C++},
  researchr = {https://researchr.org/publication/SharkeyR08},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {52},
  number = {1},
  pages = {14-31},
}