scientific article; zbMATH DE number 3078984

Cited in

(98)

Predictive control for hybrid systems. Implications of polyhedral pre-computations
Converting between quadrilateral and standard solution sets in normal surface theory
Applications of polyhedral computations to the analysis and verification of hardware and software systems
The word problem in free normal valued lattice-ordered groups: A solution and practical shortcuts
Computing extreme rays of the metric cone for seven points
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
A counterexample to Greenberg's algorithm for solving linear inequalities
Efficient enumeration of the vertices of polyhedra associated with network LP's
Enumerating extreme points of a highly degenerate polytope
How good are convex hull algorithms?
Zero polyhedral cones
Obtaining simultaneous solutions of linear subsystems of inequalities and duals
Estimating the number of vertices of a polyhedron
Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
The generalized linear complementarity problem and an algorithm to find all its solutions
Combinatorial optimization and small polytopes
An algorithm for determining redundant inequalities and all solutions to convex polyhedra
Linearly constrained global optimization: a general solution algorithm with applications.
Efficient solution generation for multiple objective linear programming based on extreme ray generation method
Complete linear descriptions of small asymmetric traveling salesman polytopes
Segments in enumerating faces
A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra
On the occurrence probability of local binary patterns: a theoretical study
Computing the vertices of tropical polyhedra using directed hypergraphs
On the efficiency of convex polyhedra
Constrained random matching
How to find the convex hull of all integer points in a polyhedron?
PPLite: zero-overhead encoding of NNC polyhedra
Quantum violation of the suppes-zanotti inequalities and ``contextuality
Exact join detection for convex polyhedra and other numerical abstractions
Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
Two variations of graph test in double description method
Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
Geometry of possibility measures on finite sets
Computing convex hulls and counting integer points with \texttt{polymake}
a-tint: a polymake extension for algorithmic tropical intersection theory
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
Multiparametric linear programming with applications to control
Finding all vertices of a convex polyhedron
A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities
Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization
Efficient constraint/generator removal from double description of polyhedra
Efficient elimination of redundancies in polyhedra by raytracing
Generalizing the template polyhedral domain
The Expressive Power of Binary Submodular Functions
On the geometry of predictive control with nonlinear constraints
Optimizing the double description method for normal surface enumeration
On the convex hull of projective planes
Finiteness of stationary configurations of the four-vortex problem
Eliminating extraneous edges in Greenberg's algorithm
Saddle points and scalarizing sets in multiple objective linear programming
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
An algorithm for determining all extreme points of a convex polytope
Least distance methods for the scheme of polytopes
A sweep-plane algorithm for generating random tuples in simple polytopes
Increasing interdependence of multivariate distributions
The rankability of data
Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Statistical decision analysis of stochastic linear programming problems
Motivation for working in numerical analysis
Accelerating Fourier-Motzkin elimination using bit pattern trees
Generating all vertices of a polyhedron is hard
A method of transferring polyhedron between the intersection-form and the sum-form
Model predictive control for perturbed max-plus-linear systems
Volume‐based ranking method for a ranked voting system
A directed persistent homology theory for dissimilarity functions
Arbitrage-Free Neural-SDE Market Models
A General Method for Deriving Tight Symbolic Bounds on Causal Effects
Symbolic analysis of linear hybrid automata -- 25 years later
Computing Shintani domains
Incremental convex hull algorithms are not output sensitive
Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction
Revisiting polyhedral analysis for hybrid systems
Double description method revisited
Some applications of combinatorial optimization in parallel computing
The two variable per inequality abstract domain
Traversing combinatorial 0/1-polytopes via optimization
An algorithm to find the lineality space of the positive hull of a set of vectors
New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
The polytope of optimal approximate designs: extending the selection of informative experiments
Global and preference-based optimization with mixed variables using piecewise affine surrogates
An efficient algorithm for vertex enumeration of arrangement
Near-derangements and their polytopes
MILP modeling of S-box: divide and merge approach
Bell-type inequalities for quasi-copulas
Predicting demand for new products using polytope volume and benchmarking
New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
Prospective control in an enhanced manpower planning model
Solving linear generalized Nash games using an active signature method
Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
Finiteness of relative equilibria of the four-body problem
Enumeration of Nash equilibria for two-player games
Some ways to reduce the space dimension in polyhedra computations
Numerical solution of special matrix games
PANDA: a software for polyhedral transformations
The expressive power of binary submodular functions

This page was built for publication:

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