Given a capacitated network, we consider the problem of choosing the edges to be activated to ensure the routing of a set of traffic demands. Both splittable and unsplittable flows are investigated. We present polyhedral results and develop a branch-and-cut algorithm based on a Benders decomposition approach to solve the problem.
Benders decomposition for capacitated network design
Mattia;Sara
2016
Abstract
Given a capacitated network, we consider the problem of choosing the edges to be activated to ensure the routing of a set of traffic demands. Both splittable and unsplittable flows are investigated. We present polyhedral results and develop a branch-and-cut algorithm based on a Benders decomposition approach to solve the problem.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
