Minimum Lk path partitioning-An illustration of the Monge property

Pei Hao Ho; Arie Tamir; Bang Ye Wu

doi:10.1016/j.orl.2007.03.010

Minimum L_k path partitioning-An illustration of the Monge property

Pei Hao Ho, Arie Tamir, Bang Ye Wu^*

^*Corresponding author for this work

School of Mathematical Sciences

Shu-Te University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We investigate the problem of cutting a given sequence of positive real numbers into p pieces, with the objective of minimizing the L_k 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.

Original language	English
Pages (from-to)	43-45
Number of pages	3
Journal	Operations Research Letters
Volume	36
Issue number	1
DOIs	https://doi.org/10.1016/j.orl.2007.03.010
State	Published - Jan 2008

Funding

Funders	Funder number
National Science Council	94-2213-E-366-006

Keywords

Convexity
Dynamic programming
Monge property
Partition

Access to Document

10.1016/j.orl.2007.03.010

Cite this

@article{4bd6343560d64338a73fbfc908de50af,

title = "Minimum Lk path partitioning-An illustration of the Monge property",

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.",

keywords = "Convexity, Dynamic programming, Monge property, Partition",

author = "Ho, {Pei Hao} and Arie Tamir and Wu, {Bang Ye}",

note = "Funding Information: Bang Ye Wu and Pei-Hao Ho were supported in part by an NSC Grant 94-2213-E-366-006 from the National Science Council, Taiwan. The authors thank Gerhard Woeginger and Jan Karel Lenstra for their contribution to this collaboration. ",

year = "2008",

month = jan,

doi = "10.1016/j.orl.2007.03.010",

language = "אנגלית",

volume = "36",

pages = "43--45",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Minimum Lk path partitioning-An illustration of the Monge property

AU - Ho, Pei Hao

AU - Tamir, Arie

AU - Wu, Bang Ye

N1 - Funding Information: Bang Ye Wu and Pei-Hao Ho were supported in part by an NSC Grant 94-2213-E-366-006 from the National Science Council, Taiwan. The authors thank Gerhard Woeginger and Jan Karel Lenstra for their contribution to this collaboration.

PY - 2008/1

Y1 - 2008/1

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

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

KW - Convexity

KW - Dynamic programming

KW - Monge property

KW - Partition

UR - http://www.scopus.com/inward/record.url?scp=37049018623&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2007.03.010

DO - 10.1016/j.orl.2007.03.010

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:37049018623

SN - 0167-6377

VL - 36

SP - 43

EP - 45

JO - Operations Research Letters

JF - Operations Research Letters

IS - 1

ER -