|
Avtomatika i Telemekhanika, 2007, Issue 6, Pages 18–23
(Mi at997)
|
|
|
|
This article is cited in 9 scientific papers (total in 9 papers)
Deterministic Systems
On one problem of integer optimization
V. A. Bondarenko, B. V. Uryvaev Yaroslavl State University
Abstract:
A recognition problem of the following form is studied: to find put for the prescribed polyhedron whether the maximum of the linear objective function is achieved at its integral point. It is established that this problem is NP-hard in the general case and polynomially solvable in the class of rooted semimetric polyhedra.
Citation:
V. A. Bondarenko, B. V. Uryvaev, “On one problem of integer optimization”, Avtomat. i Telemekh., 2007, no. 6, 18–23; Autom. Remote Control, 68:6 (2007), 948–953
Linking options:
https://www.mathnet.ru/eng/at997 https://www.mathnet.ru/eng/at/y2007/i6/p18
|
Statistics & downloads: |
Abstract page: | 385 | Full-text PDF : | 155 | References: | 37 | First page: | 1 |
|