Demand allocation with latency cost functions

Details Demand allocation with latency cost functions Demand allocation with latency cost functions

2008-10-09

arxiv.org/abs/0810.1650v1

Computer Science

Discrete Mathematics

Scientific paper

We address the exact resolution of a MINLP model where resources can be activated in order to satisfy a demand (a partitioning constraint) while minimizing total cost. Cost functions are convex latency functions plus a fixed activation cost. A branch and bound algorithm is devised, featuring three important characteristics. First, the lower bound (therefore each subproblem) can be computed in O(nlog n). Second, to break symmetries resulting in improved efficiency, the branching scheme is n-ary (instead of the "classical" binary). Third, a very affective heuristic is used to compute a good upper bound at the root node of the enumeration tree. All three features lead to a successful comparison against CPLEX MIPQ, which is the fastest among several commercial and open-source solvers: computational results showing this fact are provided.

Affiliated with

Also associated with

No associations

Rating

Demand allocation with latency cost functions 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 Demand allocation with latency cost functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Demand allocation with latency cost functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-460942