Pages that link to "Item:Q1903365"
From MaRDI portal
The following pages link to Gröbner bases of lattices, corner polyhedra, and integer programming (Q1903365):
Displayed 23 items.
- Border bases for lattice ideals (Q321275) (← links)
- Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\) (Q432760) (← links)
- The combinatorics of modeling and analyzing biological systems (Q553904) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
- Triple-loop networks with arbitrarily many minimum distance diagrams (Q1024484) (← links)
- On the complexity of smooth projective toric varieties (Q1281708) (← links)
- Standard pairs and group relaxations in integer programming (Q1295785) (← links)
- Test sets of integer programs (Q1298753) (← links)
- Test sets for integer programs (Q1365062) (← links)
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. (Q1408266) (← links)
- The vertex ideal of a lattice. (Q1867011) (← links)
- Universal Gröbner basis associated with the maximum flow problem (Q1943084) (← links)
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases (Q2355167) (← links)
- Minimal generating sets of lattice ideals (Q2404863) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Computing the integer programming gap (Q2460632) (← links)
- Computing the algebraic relations of \(C\)-finite sequences and multisequences (Q2517807) (← links)
- On Lawrence semigroups (Q2517808) (← links)
- (Q2741341) (← links)
- Toric varieties from cyclic matrix semigroups (Q5087779) (← links)
- GRIN: An implementation of Gröbner bases for integer programming (Q5101421) (← links)
- Linear label code of a root lattice using Gröbner bases (Q6139276) (← links)