Abstract
Given an integer mxn matrix A satisfying certain regularity assumptions, a well-known integer programming problem asks to find an integer point in the associated knapsack polytope P(A, b)={x: A x= b, x>=0} or determine that no such point exists. We obtain a LLL-based polynomial time algorithm that solves the problem subject to a constraint on the location of the vector b.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.