A greedy algorithm for maximizing a linear objective function-Reference-Cited by-同舟云学术

A greedy algorithm for maximizing a linear objective function

Published:2004-01 Issue:1-3 Volume:135 Page:267-279
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Shenmaier V.V.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference7 articles.

1. Theorie des Graphes et ses Applications;Berge,1958

2. J. Edmonds, Submodular functions, matroids and certain polyhedra, in: R.K. Guy, H. Hanani, N. Sauer, J. Schonheim (Eds.), Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970, pp. 69–87.

3. Matroids and the greedy algorithm;Edmonds;Math. Programming,1971

4. Optimal assignments in ordered set;Gale;J. Combin. Theory,1968

5. O. Goecke, B. Korte, L. Lovasz, Examples and algorithmic properties of greedoids, in: B. Simeone (Ed.), Combinatorial Optimization, Lecture Notes in Mathematics, Vol. 1403, Springer, Berlin, 1986, pp. 113–161.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two Algorithms for a Class of Elliptic Problems in Shape Optimization;Mathematical Problems in Engineering;2015

2. Algorithms for Opportunistic Load Balancing Cognitive Engine;Proceedings of the 9th International Conference on Cognitive Radio Oriented Wireless Networks;2014

3. Greedy algorithms for eigenvalue optimization problems in shape design of two-density inhomogeneous materials;International Journal of Computer Mathematics;2011-01

4. Neighbor Systems and the Greedy Algorithm;SIAM Journal on Discrete Mathematics;2010-01

5. Problems on independence systems solvable by the greedy algorithm;Discrete Mathematics and Applications;2009-01