Aliev, Iskander and Henk, Martin 2012. LLL-reduction for integer knapsacks. Journal of Combinatorial Optimization 24 (4) , pp. 613-626. 10.1007/s10878-011-9411-5 |
Official URL: http://www.springerlink.com/content/1382-6905/prep...
Abstract
Given a matrix A∈ℤ m×n satisfying certain regularity assumptions, a well-known integer programming problem asks to find an integer point in the associated knapsack polytope or determine that no such point exists. We obtain an LLL-based polynomial time algorithm that solves the problem subject to a constraint on the location of the vector b.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Mathematics |
Subjects: | Q Science > QA Mathematics |
Publisher: | Springer |
ISSN: | 1573-2886 |
Last Modified: | 07 Dec 2018 20:28 |
URI: | http://orca.cf.ac.uk/id/eprint/24960 |
Citation Data
Cited 1 time in Google Scholar. View in Google Scholar
Cited 3 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |