An experimental estimate of the effectiveness of using duality to solve discrete programing problems

DOI10.1016/0041-5553(88)90067-5zbMath0706.90051OpenAlexW2031825345MaRDI QIDQ3487138

O. G. Alekseev, A. O. Alekseev, V. D. Kiselëv, G. P. Mirovitskij

Publication date: 1988

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(88)90067-5

zbMATH Keywords

lower boundsbranch and bound method

Mathematics Subject Classification ID

Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: An experimental estimate of the effectiveness of using duality to solve discrete programing problems