A generalization of the integer linear infeasibility problem
From MaRDI portal
Publication:924629
DOI10.1016/j.disopt.2007.10.004zbMath1192.90128arXivmath/0603108OpenAlexW2132175673MaRDI QIDQ924629
Ruriko Yoshida, Akimichi Takemura
Publication date: 16 May 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603108
semigroupFrobenius problemsaturationHilbert basiscontingency tablesmonoidMarkov basisdata securityindispensable movelinear integer feasibility problem
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-standard approaches to integer programming
- Compressed polytopes and statistical disclosure limitation
- Conditions for the existence of solutions of the three-dimensional planar transportation problem
- Geometric algorithms and combinatorial optimization
- Algebraic algorithms for sampling from conditional distributions
- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- Integer Programming with a Fixed Number of Variables
- The Generalized Basis Reduction Algorithm
- Some Basis Theorems for Integral Monoids
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- Three-dimensional Statistical Data Security Problems
- Short rational generating functions for lattice point problems
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Representation of Sets of Lattice Points
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
This page was built for publication: A generalization of the integer linear infeasibility problem
