Generation of all integer points for given sets of linear inequalities

DOI10.1007/BF01585001MaRDI QIDQ5668606zbMATH OpenFDO

Authors J. C. Fiorot

Publication date 1972

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01585001

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• Equivalent Integer Programs and Canonical Problems
• scientific article; zbMATH DE number 3307148 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Some polyhedra related to combinatorial problems

Cited in

(2)

• Linear max-min programming
• A note on the solution of group knapsack problems

This page was built for publication: Generation of all integer points for given sets of linear inequalities

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