The following pages link to (Q5638111):
Displayed 26 items.
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Linear quadratic programming in oriented matroids (Q760437) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- A finite crisscross method for oriented matroids (Q1073036) (← links)
- The incidence structure of subspaces with well-scaled frames (Q1110520) (← links)
- Algebraic flows in regular matroids (Q1138993) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- Five variations on a theme by Gyula Farkas (Q1197393) (← links)
- A saddlepoint theorem for self-dual linear systems (Q1215686) (← links)
- Some properties of Chebyshev approximation in a subspace of \(R^n\) (Q1221253) (← links)
- Orientability of matroids (Q1245227) (← links)
- A combinatorial abstraction of linear programming (Q1245770) (← links)
- Matroids on partially ordered sets (Q1271880) (← links)
- A guided tour through oriented matroid axioms (Q1314943) (← links)
- On the equivalence of constrained and unconstrained flows (Q1339398) (← links)
- Max-balanced flows in oriented matroids (Q1343786) (← links)
- EP theorems and linear complementarity problems (Q1392569) (← links)
- Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values (Q1608406) (← links)
- Dynamical and topological aspects of Lyapunov graphs (Q1773856) (← links)
- Gröbner bases of toric varieties (Q1812964) (← links)
- Generalizing the all-pairs min cut problem (Q1910514) (← links)
- Convex programming and systems of elementary monotonic relations (Q2525908) (← links)
- Matroid basis graphs. II (Q2555857) (← links)
- Normality of semigroups with some links to graph theory. (Q2575799) (← links)
- The Null Space Problem I. Complexity (Q3747622) (← links)
- Probability logic for type spaces (Q5938620) (← links)