论文信息 - A greedy algorithm for some classes of integer programs

A greedy algorithm for some classes of integer programs

We establish a necessary and sufficient condition for a greedy algorithm to find an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalization of matroids and integer polymatroids preserving the optimality of greedy solutions.

V. V. Shenmaier | Vladimir Shenmaier

[1] Roy Goetschel. Linear objective functions on certain classes of greedoids , 1986, Discret. Appl. Math..

[2] R. Rado. Note on Independence Functions , 1957 .

[3] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[4] László Lovász,et al. Examples and algorithmic properties of Greedoids , 1989 .

[5] Henry D. Shapiro,et al. An Exact Characterization of Greedy Structures , 1993, IPCO.

[6] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..

[7] Andreas W. M. Dress,et al. Well-layered maps—A class of greedily optimizable set functions , 1995 .

[8] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .