Aggregation of inequalities in integer programming

Annals of Discrete Mathematics

Volumn 1, Issue C, 1977, Pages 145-162

  Chvátal, Václav ^a   Hammer, Peter L ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957101001     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70731-3     Document Type: Article

References (14)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, 1974, Addison-Wesley, Reading MA.
2. Bradley, G.H., Transformation of integer programs to knapsack problems. Discrete Math. 1 (1971), 29–45.
3. Chow, C.K., Boolean functions realizable with single threshold devices. Proc. IRE 49 (1961), 370–371.
4. Chvátal, V., On Hamiltonian's ideals. J. Comb. Theory 12:B (1972), 163–168.
5. Chvátal, V., Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973), 215–228.
6. Cook, S.A., The complexity of theorem proving procedures. Proc. Third Annual ACM Symposium on Theory of Computing, 1971, 151–158.
7. Edmonds, J., Paths, trees, and flowers. Canad. J. Math. 17 (1965), 449–467.
8. Elgot, C.C., Truth functions realizable by single threshold organs. IEEE Symposium on Switching Circuit Theory and Logical Design, 1961, 225–245.
9. Erdös, P., Graph theory and probability, II. Canad. J. Math. 13 (1961), 346–352.
10. Karp, R.M., Reducibility among combinatorial problems. Miller, R.E., Thatcher, J.W., (eds.) Complexity of Computer Computations, 1972, Plenum Press, New York.
11. Poljak, S., A note on stable sets and colorings of graphs. Comm. Math. Univ. Carolinae 15 (1974), 307–309.
12. Rosenberg, I.G., Aggregation of equations in integer programming. Discrete Math. 10 (1974), 325–341.
13. Slivinski, T.A., An extension of threshold logic. IEEE TC C-19 (1970), 319–341.
14. Winder, R.O., Threshold Logic, 1962, Mathematics Dept., Princeton University (Ph. D. thesis).