SERIES-PARALLEL COMPOSITION OF GREEDY LINEAR-PROGRAMMING PROBLEMS

Authors
BEIN WW BRUCKER P HOFFMAN AJ
Citation
Ww. Bein et al., SERIES-PARALLEL COMPOSITION OF GREEDY LINEAR-PROGRAMMING PROBLEMS, Mathematical programming, 62(1), 1993, pp. 1-14
Citations number
13
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Applications & Cybernetics
Journal title
Mathematical programming → ACNP
ISSN journal
00255610
Volume
62
Issue
1
Year of publication
1993
Pages
1 - 14
Database
ISI
SICI code
0025-5610(1993)62:1<1:SCOGLP>2.0.ZU;2-K
Abstract
We study the concept of series and parallel composition of linear prog ramming problems and show that greedy properties are inherited by such compositions. Our results are inspired by earlier work on composition s of flow problems. We make use of certain Monge properties as well as convexity properties which support the greedy method in other context s.