The complexity of finding two disjoint paths with min-max objective function

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi. The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Mathematics, 26(1):105-115, 1990. [doi]

@article{LiMS90,
  title = {The complexity of finding two disjoint paths with min-max objective function},
  author = {Chung-Lun Li and S. Thomas McCormick and David Simchi-Levi},
  year = {1990},
  doi = {10.1016/0166-218X(90)90024-7},
  url = {http://dx.doi.org/10.1016/0166-218X(90)90024-7},
  researchr = {https://researchr.org/publication/LiMS90},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {26},
  number = {1},
  pages = {105-115},
}