A general linear programming model for an order-theoretic analysis of both Edmonds' greedy algorithm for matroids and the NW-corner rule for transportation problems with Monge costs is introduced. This approach includes the model of Queyranne, Spieksma and Tardella (1993) as a special case. We solve the problem by optimal greedy algorithms for rooted forests as underlying structures. Other solvable cases are also discussed
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimiz...
We present a general model for set systems to be independence families with respect to set families ...
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimiz...
A general ordertheoretic linear programming model for the study of matroid-type greedy algorithms is...
A general ordertheoretic linear programming model for the study of matroid-type greedy algorithms is...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
We survey some recent developments in the analysis of greedy algorithms for assignment and transport...
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...
An algebraic model generalizing submodular polytopes is presented, where modular functions on partia...
We study the matroid secretary problems with submodular valuation functions. In these prob-lems, the...
International audienceWe revisit fundamental problems in undirected and directed graphs, such as the...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
AbstractThe submodular function minimization problem (SFM) is a fundamental problem in combinatorial...
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimiz...
We present a general model for set systems to be independence families with respect to set families ...
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimiz...
A general ordertheoretic linear programming model for the study of matroid-type greedy algorithms is...
A general ordertheoretic linear programming model for the study of matroid-type greedy algorithms is...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
We survey some recent developments in the analysis of greedy algorithms for assignment and transport...
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...
An algebraic model generalizing submodular polytopes is presented, where modular functions on partia...
We study the matroid secretary problems with submodular valuation functions. In these prob-lems, the...
International audienceWe revisit fundamental problems in undirected and directed graphs, such as the...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
AbstractThe submodular function minimization problem (SFM) is a fundamental problem in combinatorial...
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimiz...
We present a general model for set systems to be independence families with respect to set families ...
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimiz...
DOI
Add to ORKG