Some Basis Theorems for Integral Monoids

DOI10.1287/MOOR.3.2.145MaRDI QIDQ4190435zbMATH OpenOpenAlexFDO

Authors Robert G. Jeroslow

Publication date 1978

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.3.2.145

zbMATH Keywords

Basis TheoremsCutting-PlanesInteger ProgrammingIntegral Monoid

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Diophantine inequalities (11D75) Semigroups (20M99) Polytopes and polyhedra (52Bxx) Integer programming (90C10)

Cited in

(14)

• An integer analogue of Carathéodory's theorem
• A topological characterization for closed sets under polar duality in \({\mathbb{Q}{}}^ n\)
• Mixed-integer bilevel representability
• Mixed integer linear programming formulation techniques
• Weyl-minkowski duality for integarl monoids^*
• The value function of an integer program
• Combinatorial properties of integer matrices and integer matrices \(\mathrm{mod}\, k\)
• Bilevel Integer Programs with Stochastic Right-Hand Sides
• Alternating sign matrices, extensions and related cones
• New Bounds for the Integer Carathéodory Rank
• Generator subadditive functions for mixed-integer programs
• Constructive characterizations of the value-function of a mixed-integer program. I
• Total weak unimodularity: Testing and applications
• A generalization of the integer linear infeasibility problem

This page was built for publication: Some Basis Theorems for Integral Monoids

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