Computing generating sets of lattice ideals (original) (raw)
Related papers
Computing generating sets of lattice ideals and Markov bases of lattices
Journal of Symbolic Computation, 2009
Integer Programming, Lattices, and Results in Fixed Dimension
Handbooks in Operations Research and Management Science, 2005
Truncated Markov bases and Gr\"obner bases for Integer Programming
2006
A generalization of the integer linear infeasibility problem
Computing Gröbner bases associated with lattices
Advances in Mathematics of Communications, 2016
On integer programing with bounded determinants
2015
On the Complexity of Toric Ideals
ArXiv, 2019
A note on the shortest lattice vector problem
1999
2018
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Mathematical Programming, 2017
On the parallel complexity of integer programming
Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, 1989
Order, 1987
Algorithmic Algebraic Combinatorics and Gröbner Bases
Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009
An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
Mathematics of Operations Research, 2010
An algorithm for dualization in products of lattices and its applications
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
arXiv (Cornell University), 2018
Construction piA\pi_ApiA and piD\pi_DpiD Lattices: Construction, Goodness, and Decoding Algorithms
arXiv (Cornell University), 2015
Integer programs with block structure
Habilitations-Schrift, Technische Universität Berlin, 1998
Lattice based extended formulations for integer linear equality systems
2010
Non-standard approaches to integer programming
Discrete Applied Mathematics, 2002
Partial Gröbner Bases for Multiobjective Integer Linear Optimization
SIAM Journal on Discrete Mathematics, 2009
SIAM Journal on Discrete Mathematics, 2018
An optimization problem for lattices
Lajos Hajdu, Attila Pethő, Michael Pohst
Experimental Mathematics, 2013
On integer programming with bounded determinants
Optimization Letters
Computation and Manipulation of Enumerators of Integer Projections of
On the knapsack closure of 0-1 Integer Linear Programs
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond
ArXiv, 2019
Lattice Problems in NP ∩ coNP
2004
On the robust hardness of Gröbner basis computation
Journal of Pure and Applied Algebra
Journal of the ACM, 2005
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
Combinatorica, 1990
Extremal Ideals of the Lattice of Multisets
A fast algorithm for building lattices
Information Processing Letters, 1999
Lecture Notes : "Topics in Algebraic Computation"
Extended Hardness Results for Approximate Gröbner Basis Computation
ArXiv, 2016