Minimum Lk path partitioning – An illustration of the Monge property

Minimum Lk path partitioning – An illustration of the Monge property

0.00 Avg rating—0 Votes
Article ID: iaor2009629
Country: Netherlands
Volume: 36
Issue: 1
Start Page Number: 43
End Page Number: 45
Publication Date: Jan 2008
Journal: Operations Research Letters
Authors: , ,
Keywords: computational analysis
Abstract:

We investigate the problem of cutting a given sequence of positive real numbers into p pieces, with the objective of minimizing the Lk norm of the sums of the numbers in these pieces. We observe that this problem satisfies a Monge property, and thus derive fast algorithms for it.

Reviews

Required fields are marked *. Your email address will not be published.