A primal (all-integer) integer programming algorithm
From MaRDI portal
Publication:5602536
DOI10.6028/JRES.069B.025zbMath0204.19001MaRDI QIDQ5602536
Publication date: 1965
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items (8)
On nonlinear optimization in integers ⋮ Integral simplex using decomposition with primal cutting planes ⋮ New technique for solving primal all-integer linear programming ⋮ A note comparing glover's and young's simplified primal algorithms ⋮ The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques ⋮ A bounded dual (all-integer) integer programming algorithm with an objective cut ⋮ Non-standard approaches to integer programming ⋮ Some polyhedra related to combinatorial problems
This page was built for publication: A primal (all-integer) integer programming algorithm
