Elementare Theorie der konvexen Polyeder
From MaRDI portal
Publication:1840425
DOI10.1007/BF01292722zbMath0011.41104OpenAlexW2019827501WikidataQ106728042 ScholiaQ106728042MaRDI QIDQ1840425
Publication date: 1935
Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/138641
Related Items
Polyhedral proof methods in combinatorial optimization, Representability in mixed integer programming. I: Characterization results, OPTION SURFACE STATISTICS WITH APPLICATIONS, The Boolean Quadric Polytope, On a generalization of theFarkas theorem, Entscheidungsmodelle über angeordneten körpern, Consistency, redundancy, and implied equalities in linear systems, El metodo del «simplex» de la programacion lineal, Modeling combinatorial disjunctive constraints via junction trees, PANDA: a software for polyhedral transformations, Betweenness for real vectors and lines. I: Basic generalities, An analytical comparison of different formulations of the travelling salesman problem, Unnamed Item, Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces, Extreme points of convex sets without completeness of the Scalar field, A generalization of Voronoi's reduction theory and its application, A game-theoretic approach to the binary stochastic choice problem, The coming of game theory, Geometry of the multidimensional stability domain in the space of even (odd) coefficients of the characteristic polynomial of linear systems, Unnamed Item, Polyhedral approximations of the semidefinite cone and their application, A note on the short algebraic proof of Farkas' Lemma, Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces, A representation of generalized convex polyhedra and applications, Quelques classes de problèmes extrémaux. II, Some characterizations of convex polyhedra, Theory of path structure, I, On the uniqueness of solutions to linear complementarity problems, Linear inequalities and some of their applications, An algorithm for determining redundant inequalities and all solutions to convex polyhedra, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow
