Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron
type: Item
instance of: scholarly article
title: Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron
zbMATH Open document ID: 0625.90057
DOI: 10.1007/BF01068359
author: Nguen Ngok Tyu
published in: Cybernetics
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4016595
MaRDI profile type: Publication
cites work: Q3932590
cites work: A new algorithm for solving the discrete programming problem
full work available at URL: https://doi.org/10.1007/bf01068359
OpenAlex ID: W2069631132
description: scientific article