The structure of an integral monoid and integer programming feasibility (Q2277141)

From MaRDI portal
Revision as of 07:33, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The structure of an integral monoid and integer programming feasibility
scientific article

    Statements

    The structure of an integral monoid and integer programming feasibility (English)
    0 references
    1990
    0 references
    An integer programming problem is feasible if the right-hand side vector belongs to the integral monoid generated by columns of the left-hand side matrix. The author investigates a group structure on the elements of the monoid situated in the boxes restricted by at most \(k\) (\(k\) is a constant depending on the matrix) summand columns of the matrix and suggests a method for testing feasibility. The method is more efficient for problems with fixed matrix and varying right-hand side.
    0 references
    0 references
    integer linear programming
    0 references
    Hilbert base
    0 references
    integral monoid
    0 references
    group structure
    0 references
    testing feasibility
    0 references
    0 references