Technical Note—Recognizing Unbounded Integer Programs

DOI10.1287/opre.35.1.140zbMath0614.90080OpenAlexW2116209568MaRDI QIDQ4723571

Miriam Heller, A. J. Goldman, Byrd, Richard H.

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.1.140

zbMATH Keywords

unbounded continuous relaxation

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

Irreducible infeasible sets in convex mixed-integer programs ⋮ An Isometric Surface Method For Integer Linear Programming * *Supported by the R&D base on advanced manufacturing technology, Academia Sinica ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories

This page was built for publication: Technical Note—Recognizing Unbounded Integer Programs