scientific article; zbMATH DE number 3365043
From MaRDI portal
zbMath0229.90019MaRDI QIDQ5638111
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Numerical linear algebra (65F99)
Related Items
A determinantal formula for circuits of integer lattices, On the equivalence of constrained and unconstrained flows, Max-balanced flows in oriented matroids, On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, The incidence structure of subspaces with well-scaled frames, Generalizing the all-pairs min cut problem, The Null Space Problem I. Complexity, An implementation of steepest-descent augmentation for linear programs, Circuit walks in integral polyhedra, EP theorems and linear complementarity problems, Algebraic flows in regular matroids, Abstract tropical linear programming, An update-and-stabilize framework for the minimum-norm-point problem, Canonical bases in linear programming, Edges versus circuits: a hierarchy of diameters in polyhedra, Optimal cocircuits in regular matroids and applications, Sign conditions for the existence of at least one positive solution of a sparse polynomial system, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, Constructing Clustering Transformations, On the circuit diameter conjecture, Five variations on a theme by Gyula Farkas, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Probability logic for type spaces, A saddlepoint theorem for self-dual linear systems, Some properties of Chebyshev approximation in a subspace of \(R^n\), Dynamical and topological aspects of Lyapunov graphs, Orientability of matroids, A combinatorial abstraction of linear programming, Linear codes over signed graphs, On Proximity for k-Regular Mixed-Integer Linear Optimization, Convex programming and systems of elementary monotonic relations, Gröbner bases of toric varieties, A note on the approximability of deepest-descent circuit steps, Matroids on partially ordered sets, Linear quadratic programming in oriented matroids, A polyhedral model for enumeration and optimization over the set of circuits, On the Bijectivity of Families of Exponential/Generalized Polynomial Maps, Matroid basis graphs. II, Normality of semigroups with some links to graph theory., A guided tour through oriented matroid axioms, Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization, Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values, A finite crisscross method for oriented matroids
