scientific article
From MaRDI portal
Publication:4038746
zbMath0771.13014MaRDI QIDQ4038746
Pasqualina Conti, Carlo Traverso
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Minimal resolutions of lattice ideals and integer linear programming, Computing generating sets of lattice ideals and Markov bases of lattices, Gröbner bases and triangulations of the second hypersimplex, Generating functions and duality for integer programs, A discrete Farkas lemma, Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method, An algebraic geometry algorithm for scheduling in presence of setups and correlated demands, Test sets for integer programs, Gröbner bases and their application to the Cauchy problem on finitely generated affine monoids, Unnamed Item, Representing and solving finite-domain constraint problems using systems of polynomials, Binomial ideals, GRIN: An implementation of Gröbner bases for integer programming, A mathematical programming approach to the computation of the omega invariant of a numerical semigroup, Alternatives for testing total dual integrality, Some algebraic methods for solving multiobjective polynomial integer programs, Decomposition of modular codes for computing test sets and Graver basis, Gröbner bases of contraction ideals, Gröbner bases of certain zero-dimensional ideals arising in coding theory, On selection of nonmultiplicative prolongations in computation of Janet bases, The generic Gröbner walk, Test sets and inequalities for integer programs, Initial ideals of unimodular integer programs, An algebraic algorithm for solving parametric integer programs, Solving thousand-digit Frobenius problems using Gröbner bases, Non-standard approaches to integer programming, An algebraic approach to integer portfolio problems, The combinatorics of modeling and analyzing biological systems, Sequential importance sampling for multiway tables, Algebraic algorithms for sampling from conditional distributions, Enumerating Polytropes, On the complexity of smooth projective toric varieties, \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\), Standard pairs and group relaxations in integer programming, Applying Gröbner basis method to multiparametric polynomial nonlinear programming, Test sets of integer programs, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
