On the generality of the greedy algorithm for solving matroid base problems
- 1 November 2015
- journal article
- conference paper
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 195, 114-128
Abstract
No abstract availableKeywords
Funding Information
- Federal Ministry of Education and Research (13N12826)
This publication has 18 references indexed in Scilit:
- The algebraic Monge property and path problemsDiscrete Applied Mathematics, 2005
- Lattice path matroids: enumerative aspects and Tutte polynomialsJournal of Combinatorial Theory, Series A, 2003
- On k-sum optimizationOperations Research Letters, 1996
- On combined minmax-minsum optimizationComputers & Operations Research, 1994
- Minimum deviation and balanced optimization: A unified approachOperations Research Letters, 1991
- k-Sum optimization problemsOperations Research Letters, 1990
- Minimum deviation problemsOperations Research Letters, 1988
- On ordered weighted averaging aggregation operators in multicriteria decisionmakingIEEE Transactions on Systems, Man, and Cybernetics, 1988
- Efficient algorithms for a family of matroid intersection problemsJournal of Algorithms, 1984
- Algebraic flows in regular matroidsDiscrete Applied Mathematics, 1980