|
|||||
|
|
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory |
|
| Authors: | G. Morton R. von Randow K. Ringwald |
| Affiliation: | (1) Fachbereich Wirtschaftswissenschaften und Statistik, Universität Konstanz, Universitätsstrasse 10, 7750 Konstanz, FR Germany;(2) Institut für Operations Research, Universität Bonn, Nassestrasse 2, 5300 Bonn 1, FR Germany;(3) Fachbereich 11: Mathematik, Universität und Gesamthochschule Duisburg, Lotharstrasse 65, 4100 Duisburg, FR Germany |
| Abstract: | We present a greedy algorithm for solving a special class of convex programming problems and establish a connection with polymatroid theory which yields a theoretical explanation and verification of the algorithm via some recent results of S. Fujishige. |
| Keywords: | Convex Programming Greedy Algorithm Polymatroid |
| 本文献已被 SpringerLink 等数据库收录！ | |