A new algorithm for solving the discrete programming problem

DOI10.1016/0041-5553(81)90008-2zbMATH Open0492.90062OpenAlexW2004880248MaRDI QIDQ3955165FDOQ3955165

Authors: Nguen Ngok Tyu, N. V. Chernikova 

Publication date: 1981

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(81)90008-2

zbMATH Keywords

solution algorithmcontinuous solutionenumeration method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)

Cited In (1)

• Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron

This page was built for publication: A new algorithm for solving the discrete programming problem

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