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

DOI10.1007/BF01068359zbMath0625.90057OpenAlexW2069631132MaRDI QIDQ3028720

Nguen Ngok Tyu

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068359

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Cites Work

• Unnamed Item
• A new algorithm for solving the discrete programming problem

This page was built for publication: Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron