A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

Arie Tamir

doi:10.1007/BF01581240

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

Arie Tamir

School of Mathematical Sciences

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

Abstract

We present strongly polynomial algorithms to find rational and integer flow vectors that minimize a convex separable quadratic cost function on two-terminal series-parallel graphs.

Original language	English
Pages (from-to)	117-132
Number of pages	16
Journal	Mathematical Programming
Volume	59
Issue number	1-3
DOIs	https://doi.org/10.1007/BF01581240
State	Published - Mar 1993

Keywords

Quadratic cost flow problems
series-parallel graphs
strongly polynomial algorithms

Access to Document

10.1007/BF01581240

Cite this

@article{adc12d64d6524bf1aa9c2567c3cc9b4d,

title = "A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks",

abstract = "We present strongly polynomial algorithms to find rational and integer flow vectors that minimize a convex separable quadratic cost function on two-terminal series-parallel graphs.",

keywords = "Quadratic cost flow problems, series-parallel graphs, strongly polynomial algorithms",

author = "Arie Tamir",

year = "1993",

month = mar,

doi = "10.1007/BF01581240",

language = "אנגלית",

volume = "59",

pages = "117--132",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1-3",

}

TY - JOUR

T1 - A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

AU - Tamir, Arie

PY - 1993/3

Y1 - 1993/3

N2 - We present strongly polynomial algorithms to find rational and integer flow vectors that minimize a convex separable quadratic cost function on two-terminal series-parallel graphs.

AB - We present strongly polynomial algorithms to find rational and integer flow vectors that minimize a convex separable quadratic cost function on two-terminal series-parallel graphs.

KW - Quadratic cost flow problems

KW - series-parallel graphs

KW - strongly polynomial algorithms

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

U2 - 10.1007/BF01581240

DO - 10.1007/BF01581240

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

AN - SCOPUS:34250078775

VL - 59

SP - 117

EP - 132

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1-3

ER -

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this