A primal (all-integer) integer programming algorithm

DOI10.6028/JRES.069B.025MaRDI QIDQ5602536zbMATH OpenFDO

Authors Richard D. Young

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)

Full work available at URL https://doi.org/10.6028/JRES.069B.025

Cited in

(9)

• New technique for solving primal all-integer linear programming
• Non-standard approaches to integer 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
• On nonlinear optimization in integers
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• Integral simplex using decomposition with primal cutting planes
• Some polyhedra related to combinatorial problems
• Augmentation search for integer programming over a polyhedron

This page was built for publication: A primal (all-integer) integer programming algorithm

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