Conference Optimization and Decision Science (ODS 2020), 2021

Branch and bound and dynamic programming approaches for the path avoiding forbidden pairs problem

Daniele Ferone · Paola Festa · Matteo Salani

Paper

Abstract

We present branch and bound and dynamic programming algorithms for the path avoiding forbidden pairs problem, a combinatorial problem arising in network routing with incompatibility constraints.

Combinatorial OptimizationDynamic ProgrammingNetwork Optimization

BibTeX

@inproceedings{ferone2021branch,
  title     = {Branch and bound and dynamic programming approaches for the path avoiding forbidden pairs problem},
  author    = {Ferone, Daniele and Festa, Paola and Salani, Matteo},
  booktitle = {Optimization and Decision Science: ODS, Virtual Conference, November 19, 2020},
  pages     = {227--235},
  year      = {2021},
  organization = {Springer International Publishing}
}