Publication | Open Access

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Mathematical ProgrammingGmpls NetworksNetwork ScienceGraph TheoryEngineeringNetwork AlgorithmStructural Graph TheoryMin-sum CostBusinessNetwork AnalysisComputer ScienceDiscrete MathematicsLexicographic ApproachNetwork OptimizationDiscrete OptimizationGraph AlgorithmCombinatorial OptimizationOperations Research