Hard Equality Constrained Integer Knapsacks
- 21 May 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 350-366
- https://doi.org/10.1007/3-540-47867-1_25
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the VariablesMathematics of Operations Research, 2000
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande InstancesLecture Notes in Computer Science, 1999
- A Class of Hard Small 0—1 ProgramsLecture Notes in Computer Science, 1998
- Decomposition of integer programs and of generating setsLecture Notes in Computer Science, 1997
- An Implementation of the Generalized Basis Reduction Algorithm for Integer ProgrammingINFORMS Journal on Computing, 1993
- Lattice translates of a polytope and the Frobenius problemCombinatorica, 1992
- Solution to a linear diophantine equation for nonnegative integersJournal of Algorithms, 1988
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- On a linear diophantine problem of FrobeniusActa Arithmetica, 1972
- On a Problem of PartitionsAmerican Journal of Mathematics, 1942