The following pages link to (Q4038746):
Displaying 36 items.
- Enumerating Polytropes (Q161347) (← links)
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (Q336618) (← links)
- Gröbner bases and their application to the Cauchy problem on finitely generated affine monoids (Q346555) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← links)
- Gröbner bases of contraction ideals (Q438745) (← links)
- An algebraic approach to integer portfolio problems (Q541725) (← links)
- The combinatorics of modeling and analyzing biological systems (Q553904) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
- On selection of nonmultiplicative prolongations in computation of Janet bases (Q926621) (← 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)
- Gröbner bases of certain zero-dimensional ideals arising in coding theory (Q1415386) (← links)
- An algebraic algorithm for solving parametric integer programs (Q1752503) (← links)
- Algebraic algorithms for sampling from conditional distributions (Q1807063) (← links)
- \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\) (Q1827486) (← links)
- Minimal resolutions of lattice ideals and integer linear programming (Q1884028) (← links)
- Gröbner bases and triangulations of the second hypersimplex (Q1900188) (← links)
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands (Q1906277) (← links)
- Binomial ideals (Q1922418) (← links)
- Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming (Q2332342) (← links)
- Generating functions and duality for integer programs (Q2386200) (← links)
- A discrete Farkas lemma (Q2386214) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- The generic Gröbner walk (Q2457423) (← links)
- Solving thousand-digit Frobenius problems using Gröbner bases (Q2481471) (← links)
- Sequential importance sampling for multiway tables (Q2493562) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- (Q2741341) (← links)
- Test sets and inequalities for integer programs (Q4645910) (← links)
- GRIN: An implementation of Gröbner bases for integer programming (Q5101421) (← links)
