The complexity of approximate algorithms for the problem of integer programming

Autor:	N.N. Kuzyurin
Rok vydání:	1984
Předmět:	Combinatorics Discrete mathematics Branch and price General Engineering Integer overflow Integer points in convex polyhedra Change-making problem Integer relation algorithm Nearest integer function Branch and cut Integer programming Mathematics
Zdroj:	USSR Computational Mathematics and Mathematical Physics. 24:100-103
ISSN:	0041-5553
DOI:	10.1016/0041-5553(84)90125-3
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::cf436d102327be6c5b72f14b7520f750 https://doi.org/10.1016/0041-5553(84)90125-3 Zobrazit plný text záznamu