Premium
A polyhedral analysis of the capacitated edge activation problem with uncertain demands
Author(s) -
Mattia Sara
Publication year - 2019
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21888
Subject(s) - polyhedron , enhanced data rates for gsm evolution , mathematical optimization , routing (electronic design automation) , computer science , set (abstract data type) , perspective (graphical) , robust optimization , mathematics , combinatorics , computer network , artificial intelligence , programming language
The capacitated edge activation problem consists of activating a minimum cost set of capacitated edges to ensure the routing of some traffic demands. If the demands are subject to uncertainty, we speak of the robust capacitated edge activation problem. We consider a capacity formulation of the problem and investigate, from a polyhedral perspective, the similarities and the differences between the robust capacitated edge activation and the robust network loading polyhedron, as well as between the polyhedra corresponding to different routing and flows policies.