Abstract
We use lattice-based methods in order to get an integer solution of the linear equation a1x1+ ⋯ + anxn= a0, which satisfies the bound constraints |xj| ≤ Xj. Further we study the corresponding homogeneous linear equation under constraints and finally we apply our method to Knapsack problem.
Author supplied keywords
Cite
CITATION STYLE
APA
Draziotis, K. A. (2014). Balanced integer solutions of linear equations. In Springer Optimization and Its Applications (Vol. 91, pp. 173–188). Springer International Publishing. https://doi.org/10.1007/978-3-319-04720-1_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free