A New Foundation for a Simplified Primal Integer Programming Algorithm

DOI10.1287/OPRE.16.4.727MaRDI QIDQ5552013zbMATH OpenOpenAlexFDO

Authors Fred Glover

Publication date 1968

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/105938db555ad349983c890adfddca3f063030c4

zbMATH Keywords

operations research

Cited in

(6)

• New technique for solving primal all-integer linear programming
• Integral simplex using decomposition with primal cutting planes
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
• A primal-like algorithm for zero-one integer Fractional Programming Problem
• Classical cuts for mixed-integer programming and branch-and-cut

This page was built for publication: A New Foundation for a Simplified Primal Integer Programming Algorithm

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