Minimum Cost Network Flows : Problems , Algorithms , and Software

@inproceedings{Sifaleras2013MinimumCN,
  title={Minimum Cost Network Flows : Problems , Algorithms , and Software},
  author={Angelo Sifaleras},
  year={2013}
}
We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear single-commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable. We also discuss state-of-the-art algorithmic approaches and recent advances in the solution methods for the MCNFP. Finally, optimization software packages for the MCNFP are presented. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 58 references

A decision support system for the design of cost - effective metropolitan area networks ”

  • E. Thibault
  • Handbook of Optimization in Complex Networks
  • 2012

A model for solving the optimal water allocation problem in river basins with network flow programming when introducing nonlinearities ”

  • D. Haro, J. Paredes, A. Solera, J. Andreu
  • Water Resources Management
  • 2012

Similar Papers

Loading similar papers…