ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
From MaRDI portal
Publication:4483735
Recommendations
- Enumeration of integer solutions to linear inequalities defined by digraphs
- An enumerative method for the solution of linear complementarity problems
- Combinatorial properties of incompatible systems of linear inequalities and polyhedra
- A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
- Computing all solutions to polynomial systems using homotopy continuation
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- Enumeration-based approach to solving parametric linear complementarity problems
- scientific article; zbMATH DE number 1693051
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
Cited in
(5)- The norm of the Fourier transform on finite abelian groups
- Combinatorial method for solving systems of linear constraints
- Mixed cell computation in HOM4ps
- Mathematical Foundations of Computer Science 2005
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
This page was built for publication: ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4483735)