A New Foundation for a Simplified Primal Integer Programming Algorithm

DOI10.1287/opre.16.4.727zbMath0165.54106OpenAlexW2152939132MaRDI QIDQ5552013

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

Related Items (6)

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

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