Pages that link to "Item:Q4051883"

The following pages link to A greedy algorithm for solving a certain class of linear programmes (Q4051883):

Displaying 18 items.

• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
• On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra (Q869913) (← links)
• Simultaneous selection (Q906442) (← links)
• The greedy algorithm for partially ordered sets (Q1140103) (← links)
• Discrete extremal problems (Q1152306) (← links)
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\) (Q1174313) (← links)
• \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
• The delta-sum of matching delta-matroids (Q1381847) (← links)
• Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
• On structures of bisubmodular polyhedra (Q1814796) (← links)
• Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 (Q1827668) (← links)
• Generalized skew bisubmodularity: a characterization and a min-max theorem (Q2339806) (← links)
• Parametric bisubmodular function minimization and its associated signed ring family (Q2357141) (← links)
• Discordant Voting Processes on Finite Graphs (Q4691143) (← links)
• The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions (Q4888278) (← links)
• Signed ring families and signed posets (Q4999327) (← links)
• Coverings and delta-coverings (Q5101418) (← links)
• Greedy systems of linear inequalities and lexicographically optimal solutions (Q5214340) (← links)