Login / Signup

On a relaxed maximally disjoint path pair problem: a bicriteria approach.

Marta M. B. PascoalJoão C. N. Clímaco
Published in: Int. Trans. Oper. Res. (2020)
Keyphrases
  • bicriteria
  • shortest path problem
  • efficient solutions
  • pairwise
  • shortest path
  • integer linear programming
  • knapsack problem
  • optimal solution
  • flowshop
  • multi objective
  • directed acyclic graph