Technical Note—Recognizing Unbounded Integer Programs

DOI10.1287/OPRE.35.1.140MaRDI QIDQ4723571zbMATH OpenOpenAlexFDO

Authors R. H. Byrd, A. J. Goldman, Miriam Heller

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)

Recommendations

• Unboundedness in reverse convex and concave integer programming
• On boundedness of (quasi-)convex integer optimization problems
• A simple test for integer programming problems with bounded integer variables
• The integrality number of an integer program
• The Integrality Number of an Integer Program

Cited in

(5)

• \textsc{OptiMathSAT}: a tool for optimization modulo theories
• An Isometric Surface Method For Integer Linear Programming * *Supported by the R&D base on advanced manufacturing technology, Academia Sinica
• Irreducible infeasible sets in convex mixed-integer programs
• Initial ideals of unimodular integer programs
• Title not available (Why is no real title available?)

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

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