×

Aggregating diophantine equations. (English) Zbl 0244.90030


MSC:

90C10 Integer programming
Full Text: DOI

References:

[1] Bradley, G. H.: Transformation of Integer Programs to Knapsack Problems, Discrete Mathematics,1, No. 1, 29–45, 1971. · Zbl 0219.90033 · doi:10.1016/0012-365X(71)90005-7
[2] Elmaghraby, S. E. andM. K. Wig: On the Treatment of Stock Cutting Problems as Diophantine Programs, Operations Research Report No. 61, North Carolina State University at Raleigh, May 11, 1970.
[3] Glover, Fred: Integer Programming Over a Finite Additive Group, Siam J. Control,7, No. 2, 213–231, 1969. · Zbl 0195.49304 · doi:10.1137/0307015
[4] Mathews, G. B.: On the Partition of Numbers, Proceedings of the London Mathematical Society,28, 486–490, 1897. · JFM 28.0168.03
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.