A deterministic annealing algorithm for the minimum concave cost network flow problem

@article{Dang2011ADA,
  title={A deterministic annealing algorithm for the minimum concave cost network flow problem},
  author={Chuangyin Dang and Yabin Sun and Yuping Wang and Yang Yang},
  journal={Neural networks : the official journal of the International Neural Network Society},
  year={2011},
  volume={24 7},
  pages={699-708}
}
The existing algorithms for the minimum concave cost network flow problems mainly focus on the single-source problems. To handle both the single-source and the multiple-source problem in the same way, especially the problems with dense arcs, a deterministic annealing algorithm is proposed in this paper. The algorithm is derived from an application of the Lagrange and Hopfield-type barrier function. It consists of two major steps: one is to find a feasible descent direction by updating Lagrange… CONTINUE READING

References

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

Similar Papers

Loading similar papers…