On the foundations of linear and integer linear programming I-Reference-Cited by-同舟云学术

On the foundations of linear and integer linear programming I

Published:1975-12 Issue:1 Volume:9 Page:207-226
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Graver Jack E.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference7 articles.

1. L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press).

2. J.E. Graver, “Maximum depth problem for indecomposable exact covers”, Proceedings of the International Colloquium on Infinite and Finite Sets, Keszthely, Hungary (1973).

3. J.E. Graver and W.B. Jurkat, “Algebra structures for general designs”,Journal of Algebra 23 (1972) 574–589.

4. J.E. Graver and W.B. Jurkat, “The module structure of integral designs”,Journal of Combinatorial Theory 15 (1973) 75–90.

5. F. Huckermann and W.B. Jurkat, “Finiteness theorems for coverings and semi-groups”, to appear.

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

1. Sparse Integer Programming Is Fixed-Parameter Tractable;Mathematics of Operations Research;2024-08-19

2. Conference Program Scheduling using Genetic Algorithms;Proceedings of the 1st ACM International Conference on AI-Powered Software;2024-07-10

3. A hybrid approach of ALNS with alternative initialization and acceptance mechanisms for capacitated vehicle routing problems;Cluster Computing;2024-07-01

4. Equivariant lattice bases;Transactions of the American Mathematical Society;2024-05-21

5. Circuits in extended formulations;Discrete Optimization;2024-05