A general model for matroids and the greedy algorithm
From MaRDI portal
Publication:1013980
DOI10.1007/s10107-008-0213-1zbMath1180.90268OpenAlexW1986925332MaRDI QIDQ1013980
Satoru Fujishige, Ulrich Faigle
Publication date: 24 April 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0213-1
Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Discrete mathematics in relation to computer science (68R99)
Related Items
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Unnamed Item, A ranking model for the greedy algorithm and discrete convexity, Matroids on convex geometries: subclasses, operations, and optimization, Greedy algorithms and poset matroids, A greedy algorithm for solving ordinary transportation problem with capacity constraints, A problem reduction based approach to discrete optimization algorithm design
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An intersection theorem for supermatroids
- Matroids on convex geometries (cg-matroids)
- The theory of convex geometries
- The greedy algorithm for partially ordered sets
- Matroids on partially ordered sets
- A greedy algorithm for some classes of integer programs.
- On the core of ordered submodular cost games
- Submodular linear programs on forests
- Structural aspects of ordered polymatroids
- Dual greedy polyhedra, choice functions, and abstract convex geometries
- Submodular functions and optimization.
- A General Class of Greedily Solvable Linear Programs
- On ordered languages and the optimization of linear functions by greedy algorithms
- Optimal assignments in an ordered set: An application of matroid theory
- Matroids and the greedy algorithm
- An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
