Integer Minkowski Programs and the Design of Survivable Networks

Simple item page
dc.creatorEisenschmidt, Elke
dc.creatorKöppe, Matthias
dc.creatorLaugier, Alexandre
dc.date2006-10-27
dc.date.accessioned2026-07-07T07:29:31Z
dc.date.available2026-07-07T07:29:31Z
dc.descriptionWe introduce a new class of optimization problems called integer Minkowski programs. The formulation of such problems involves finitely many integer variables and nonlinear constraints involving functionals defined on families of discrete or polyhedral sets. We show that, under certain assumptions, it is possible to reformulate them as integer linear programs, by making use of integral generating sets. We then apply this technique to the network design problem for fractional and integral flows subject to survivability constraints.
dc.description27 pages, 9 figures
dc.identifierhttps://arxiv.org/abs/math/0610836
dc.identifierhttp://arxiv.org/abs/math/0610836
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/118141
dc.subjectOptimization and Control
dc.subject90B18; 68M10; 90C10; 90C11; 90C35
dc.titleInteger Minkowski Programs and the Design of Survivable Networks
dc.typetext

Files

Collections

arXiv