Integer Minkowski Programs and the Design of Survivable Networks

Details Integer Minkowski Programs and the Design of Survivable Networks Integer Minkowski Programs and the Design of Survivable Networks

2006-10-27

arxiv.org/abs/math/0610836v1

Mathematics

Optimization and Control

27 pages, 9 figures

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

Integer Minkowski Programs and the Design of Survivable Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Integer Minkowski Programs and the Design of Survivable Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integer Minkowski Programs and the Design of Survivable Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169672