Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm

Maria J. Blesa, Christian Blum. Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm. J. Math. Model. Algorithms, 6(3):361-391, 2007. [doi]

@article{BlesaB07,
  title = {Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm},
  author = {Maria J. Blesa and Christian Blum},
  year = {2007},
  doi = {10.1007/s10852-007-9060-y},
  url = {http://dx.doi.org/10.1007/s10852-007-9060-y},
  tags = {optimization},
  researchr = {https://researchr.org/publication/BlesaB07},
  cites = {0},
  citedby = {0},
  journal = {J. Math. Model. Algorithms},
  volume = {6},
  number = {3},
  pages = {361-391},
}