swMATH114MaRDI QIDQ12884FDOQ12884
Author name not available (Why is that?)
Official website: http://www.inf.ethz.ch/personal/fukudak/cdd_home/
Cited In (only showing first 100 items - show all)
- Polyhedral methods for space curves exploiting symmetry applied to the cyclic \(n\)-roots problem
- Polytope volume by descent in the face lattice and applications in social choice
- Hybrid Systems: Computation and Control
- 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
- Output-sensitive cell enumeration in hyperplane arrangements
- Polyhedral and algebraic methods in computational geometry
- Title not available (Why is that?)
- Sparsity in sums of squares of polynomials
- 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
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- A generalized sewing construction for polytopes
- Estimating the number of vertices of a polyhedron
- Likelihood inference in exponential families and directions of recession
- On the linear description of the 3-cycle polytope
- Monomial subrings in arbitrary dimension
- A geometric view on learning Bayesian network structures
- Multiplicative principal-minor inequalities for totally nonnegative matrices
- On generators of bounded ratios of minors for totally positive matrices
- 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
- Classification of eight-dimensional perfect forms
- Computing the integer hull of convex polyhedral sets
- The contact polytope of the Leech lattice
- 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 finite loop space not rationally equivalent to a compact Lie group
- How to draw tropical planes
- A catalog of minimally nonideal matrices
- The final NETLIB-LP results
- Exact algorithms and software in optimization and polyhedral computation
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
- Compact cellular algebras and permutation groups
- 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
- 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
- On convex relaxations of quadrilinear terms
- Geometric algorithm for multiparametric linear programming
- 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
- 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
- A counterexample to the dominating set conjecture
- Optimal control of constrained piecewise affine systems.
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- Title not available (Why is that?)
- The gfanlib interface in Singular and its applications
- SOSTOOLS and Its Control Applications
- Effective lattice point counting in rational convex polytopes
- Voronoi polytopes for polyhedral norms on lattices
- Prospective control in an enhanced manpower planning model
- The explicit linear quadratic regulator for constrained systems
- Bayesian network structure learning with integer programming: polytopes, facets and complexity
- 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
- Hybrid Systems: Computation and Control
- Extreme lower probabilities
- Small cones of \(m\)-hemimetrics
- TrIm
- Computing convex hulls and counting integer points with \texttt{polymake}
- a-tint: a polymake extension for algorithmic tropical intersection theory
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra
- A fresh view on the tolerance approach to sensitivity analysis in linear programming
- gmp
- Normaliz
- polymake
- SingSurf
- INGRID
- ZRAM
- iB4e
- jReality
- JavaView
- CARAT
- 4ti2
- SoPlex
- cddplus
- Qhull
- azove
- LattE
- Gfan
This page was built for software: cdd
