Aggregating diophantine equations-Reference-Cited by-同舟云学术

Aggregating diophantine equations

Published:1972-03 Issue:1 Volume:16 Page:1-10
ISSN:0340-9422
Container-title:Zeitschrift für Operations Research
language:en
Short-container-title:Zeitschrift für Operations Research

Author:

Glover Fred,Woolsey Robert E. D.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01917186.pdf

Reference4 articles.

1. Bradley, G. H.: Transformation of Integer Programs to Knapsack Problems, Discrete Mathematics,1, No. 1, 29–45, 1971.

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.

4. Mathews, G. B.: On the Partition of Numbers, Proceedings of the London Mathematical Society,28, 486–490, 1897.

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the complexity of surrogate and group relaxation for integer linear programs;Operations Research Letters;2021-07

2. Optimal constraints aggregation method for ILP;Discrete Applied Mathematics;2019-06

3. On the Containment Problem for Linear Sets;LEIBNIZ INT PR INFOR;2018

4. A Review of Modern Cryptography: From the World War II Era to the Big-Data Era;International Series in Operations Research & Management Science;2017

5. Zero duality gap in surrogate constraint optimization: A concise review of models;European Journal of Operational Research;2014-01