Greedy Families for Linear Objective Functions
From MaRDI portal
Publication:3970969
Recommendations
- Greedoids and Linear Objective Functions
- scientific article; zbMATH DE number 4195711
- Linear objective functions on certain classes of greedoids
- A greedy algorithm for maximizing a linear objective function
- scientific article; zbMATH DE number 1263283
- A general class of greedily solvable linear programs
- Greedy approximation in convex optimization
- Greedy strategies for convex optimization
- Greedy linear extensions with constraints
- Greedy expansions in convex optimization
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3904604 (Why is no real title available?)
- A note on two problems in connexion with graphs
- Exchange systems
- Greedoids and Linear Objective Functions
- Majors of geometric strong maps
- Matroids and the greedy algorithm
- OPTIMAL MATROID BASES: AN ALGORITHM BASED ON COCIRCUITS
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The greedy algorithm for partially ordered sets
- Theory of Matroids
Cited in
(10)- scientific article; zbMATH DE number 4191657 (Why is no real title available?)
- A framework for the greedy algorithm
- scientific article; zbMATH DE number 169611 (Why is no real title available?)
- Well-layered maps---a class of greedily optimizable set functions
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
- Greedy algorithm compatibility and heavy-set structures
- Greedy algorithms and poset matroids
- Exchange systems
- Greedy can beat pure dynamic programming
- An Exact Characterization of Greedy Structures
This page was built for publication: Greedy Families for Linear Objective Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970969)
