The structure of an integral monoid and integer programming feasibility

DOI10.1016/0166-218X(90)90006-XzbMATH Open0724.90043OpenAlexW2074413535MaRDI QIDQ2277141FDOQ2277141

Authors: Jennifer K. Ryan 

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90006-x

Recommendations

• Decomposing finitely generated integral monoids by elimination
• A simple test for integer programming problems with bounded integer variables
• scientific article; zbMATH DE number 4204116
• Parametric integer programming in fixed dimension
• Integer programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf's theorem

zbMATH Keywords

integer linear programminggroup structureintegral monoidtesting feasibilityHilbert base

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Title not available (Why is that?)
• The value function of an integer program
• Total dual integrality and integer polyhedra
• Weyl-minkowski duality for integarl monoids^*
• The constraints of the group of an integral monoid

Cited In (5)

• On a transport problem and monoids of non-negative integers
• Testing integer knapsacks for feasibility
• Computing holes in semi-groups and its applications to transportation problems
• Intermediate feasibility in 0–1 integer linear systems
• A simple test for integer programming problems with bounded integer variables

This page was built for publication: The structure of an integral monoid and integer programming feasibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277141)