cdd

swMATH114MaRDI QIDQ12884FDOQ12884

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• The gfanlib interface in Singular and its applications
• Hybrid Systems: Computation and Control
• SOSTOOLS and Its Control Applications
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
• Convex hulls, oracles, and homology
• Corrigendum to: ``The explicit linear quadratic regulator for constrained systems
• Optimal complexity reduction of polyhedral piecewise affine systems
• On the enumeration of certain weighted graphs
• Effective lattice point counting in rational convex polytopes
• Polyhedral and algebraic methods in computational geometry
• Title not available (Why is that?)
• Sparsity in sums of squares of polynomials
• Voronoi polytopes for polyhedral norms on lattices
• Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
• Reconstruction of multi-soliton interactions using crest data for \((2+1)\)-dimensional KdV type equations
• Prospective control in an enhanced manpower planning model
• A generalized sewing construction for polytopes
• Estimating the number of vertices of a polyhedron
• Likelihood inference in exponential families and directions of recession
• The explicit linear quadratic regulator for constrained systems
• The \(4\times 4\) minors of a \(5\times n\) matrix are a tropical basis
• Polymake and Lattice Polytopes
• Facet defining inequalities among graph invariants: The system graphedron
• A geometric view on learning Bayesian network structures
• Hybrid Systems: Computation and Control
• Multiplicative principal-minor inequalities for totally nonnegative matrices
• On generators of bounded ratios of minors for totally positive matrices
• Extreme lower probabilities
• Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
• Enumerating a subset of the integer points inside a Minkowski sum
• Vertex adjacencies in the set covering polyhedron
• Small cones of \(m\)-hemimetrics
• Classification of eight-dimensional perfect forms
• Computing the integer hull of convex polyhedral sets
• Computing convex hulls and counting integer points with \texttt{polymake}
• The contact polytope of the Leech lattice
• a-tint: a polymake extension for algorithmic tropical intersection theory
• Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity
• Quasi-semi-metrics, oriented multi-cuts and related polyhedra
• Counterexample-guided predicate abstraction of hybrid systems
• On packing and covering polyhedra of consecutive ones circulant clutters
• Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
• An output-sensitive algorithm for computing projections of resultant polytopes
• A fresh view on the tolerance approach to sensitivity analysis in linear programming
• How to draw tropical planes
• A catalog of minimally nonideal matrices
• Inner and outer approximations of polytopes using boxes.
• The final NETLIB-LP results
• Exact algorithms and software in optimization and polyhedral computation
• SReachTools
• A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
• A sweep-plane algorithm for generating random tuples in simple polytopes
• Constrained optimal control of linear and hybrid systems
• Computing tropical varieties
• A Presentation of the Gfan Software
• Computing Gröbner fans
• PALP: a package for analysing lattice polytopes with applications to toric geometry
• Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem
• A Petri net based approach for multi-robot path planning
• A generalization of the integer linear infeasibility problem
• Complexity and algorithms for computing Voronoi cells of lattices
• Zigzag and central circuit structure of \((\{1,2,3\}, 6)\)-spheres
• General theory for interactions in sufficient cause models with dichotomous exposures
• An improved algorithm for combinatorial multi-parametric quadratic programming
• The tropical totally positive Grassmannians
• Logic-Based Solution Methods for Optimal Control of Hybrid Systems
• Invalidation of the structure of genetic network dynamics: a geometric approach
• Computing tropical resultants
• Quantum violation of the suppes-zanotti inequalities and ``contextuality
• Enhancements on the hyperplanes arrangements in mixed-integer programming techniques
• Bézier control points method to solve constrained quadratic optimal control of time varying linear systems
• Title not available (Why is that?)
• On convex relaxations of quadrilinear terms
• Geometric algorithm for multiparametric linear programming
• Combinatorial optimization and small polytopes
• Parallel enumeration of triangulations
• From the zonotope construction to the Minkowski addition of convex polytopes
• Suboptimal explicit receding horizon control via approximate multiparametric quadratic pro\-gramming
• Homothetic tube model predictive control
• The maximum-leaf spanning tree problem: Formulations and facets
• Ehrhart polynomials of matroid polytopes and polymatroids
• How good are convex hull algorithms?
• Alternatives for testing total dual integrality
• The Hypermetric Cone on Seven Vertices
• Optimal control of constrained piecewise affine systems.
• Implementing Generating Set Search Methods for Linearly Constrained Minimization
• Polytope volume by descent in the face lattice and applications in social choice
• Linear criterion for testing the extremity of an exact game based on its finest min-representation
• Small Cones of Oriented Semi-Metrics
• SReachTools: A MATLAB stochastic reachability toolbox
• The joint weight enumerator of an LCD code and its dual
• Output-sensitive cell enumeration in hyperplane arrangements
• Finding MEMo: minimum sets of elementary flux modes
• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• On the linear description of the 3-cycle polytope
• Monomial subrings in arbitrary dimension
• Optimal patchings for consecutive ones matrices
• Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies
• Memory cost for simulating all quantum correlations from the Peres–Mermin scenario
• Deciding Polyhedrality of Spectrahedra

This page was built for software: cdd