ISSN:
1436-4646
Schlagwort(e):
Greedy algorithm
;
Monge arrays
;
series parallel graphs
;
linear programming
;
network flow
;
transportation problem
;
integrality
;
convexity
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract We study the concept of series and parallel composition of linear programming problems and show that greedy properties are inherited by such compositions. Our results are inspired by earlier work on compositions of flow problems. We make use of certain Monge properties as well as convexity properties which support the greedy method in other contexts.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01585157
