We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the specification to allow for weight functions with accumulation, which is particularly useful when the weight of each element depends on adjacent elements. This extension of weight functions enables us to treat more interesting optimization problems such as a variant of the maximum segment sum problem and the fair bonus distribution problem. The complexity of the derived algorithm is linear with respect to the size of the input data. © Springer-Verlag Berlin Heidelberg 2005.

Sasano I., Ogawa M., Hu Z.

711.pdf    Gửi cho bạn bè

Từ khóa : Linear programming; Linear systems; Maximum principle; Optimization; Accumulative weight function; Maximum marking problem; Optimization problems; Program derivation; Parallel algorithms