AbstractWe 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
AbstractThe quasi-greedy algorithm, as proposed by Glover and Klingman [8], efficiently solves minim...
Many important optimization problems, such as the minimum spanning tree and minimum-cost flow, can b...
We present the Dichotomic Greedy Algorithm (DGA) for the following resource allocation problem: maxi...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
We consider the problem of maximizing a separable concave nondecreasing function over integer points...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
AbstractIn this paper we present a new optimization problem and a general class of objective functio...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
One central question in theoretical computer science is how to solve problems accurately and quickly...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
We study the problem of maximizing a monotone non-decreasing function {Mathematical expression} subj...
Greedy algorithms are used in solving a diverse set of problems in small computation time. However, ...
AbstractThe quasi-greedy algorithm, as proposed by Glover and Klingman [8], efficiently solves minim...
Many important optimization problems, such as the minimum spanning tree and minimum-cost flow, can b...
We present the Dichotomic Greedy Algorithm (DGA) for the following resource allocation problem: maxi...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
We consider the problem of maximizing a separable concave nondecreasing function over integer points...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
AbstractIn this paper we present a new optimization problem and a general class of objective functio...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
One central question in theoretical computer science is how to solve problems accurately and quickly...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
We study the problem of maximizing a monotone non-decreasing function {Mathematical expression} subj...
Greedy algorithms are used in solving a diverse set of problems in small computation time. However, ...
AbstractThe quasi-greedy algorithm, as proposed by Glover and Klingman [8], efficiently solves minim...
Many important optimization problems, such as the minimum spanning tree and minimum-cost flow, can b...
We present the Dichotomic Greedy Algorithm (DGA) for the following resource allocation problem: maxi...
DOI
Add to ORKG