A greedy algorithm for solving a certain class of linear programmes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3253793 (Why is no real title available?)
- scientific article; zbMATH DE number 3363579 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Note on Independence Functions
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal assignments in an ordered set: An application of matroid theory
Cited in
(20)- The greedy algorithm for partially ordered sets
- Discrete extremal problems
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- b-matching degree-sequence polyhedra
- The delta-sum of matching delta-matroids
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization
- On structures of bisubmodular polyhedra
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
- Generalized skew bisubmodularity: a characterization and a min-max theorem
- Parametric bisubmodular function minimization and its associated signed ring family
- Discordant Voting Processes on Finite Graphs
- The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions
- Signed ring families and signed posets
- Coverings and delta-coverings
- Greedy systems of linear inequalities and lexicographically optimal solutions
- Rank functions and invariants of delta-matroids
- On inner independence systems
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
- Simultaneous selection
This page was built for publication: A greedy algorithm for solving a certain class of linear programmes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051883)
