Elementare Theorie der konvexen Polyeder

Cited in

(32)

Polyhedral proof methods in combinatorial optimization
Representability in mixed integer programming. I: Characterization results
Betweenness for real vectors and lines. I: Basic generalities
An analytical comparison of different formulations of the travelling salesman problem
A game-theoretic approach to the binary stochastic choice problem
Consistency, redundancy, and implied equalities in linear systems
Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces
Linear inequalities and some of their applications
An algorithm for determining redundant inequalities and all solutions to convex polyhedra
Polyhedral approximations of the semidefinite cone and their application
Geometry of the multidimensional stability domain in the space of even (odd) coefficients of the characteristic polynomial of linear systems
A generalization of Voronoi's reduction theory and its application
The coming of game theory
Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces
El metodo del «simplex» de la programacion lineal
On the uniqueness of solutions to linear complementarity problems
scientific article; zbMATH DE number 3913155 (Why is no real title available?)
Entscheidungsmodelle über angeordneten körpern
scientific article; zbMATH DE number 513105 (Why is no real title available?)
Option surface statistics with applications
The Boolean quadric polytope
A note on the short algebraic proof of Farkas' Lemma
A representation of generalized convex polyhedra and applications
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
An application of semi-infinite linear programming: approximation of a continuous function by a polynomial
On a generalization of theFarkas theorem
Extreme points of convex sets without completeness of the Scalar field
Quelques classes de problèmes extrémaux. II
Theory of path structure, I
Modeling combinatorial disjunctive constraints via junction trees
Some characterizations of convex polyhedra
PANDA: a software for polyhedral transformations

This page was built for publication: Elementare Theorie der konvexen Polyeder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840425)