×
Kannan, Ravindran; Monma, Clyde L.

On the computational complexity of integer programming problems. (English) Zbl 0409.90066

Optimization and operations research, Proc. Workshop, Bonn 1977, Lect. Notes Econ. Math. Syst. 157, 161-172 (1978).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0409.90066

Cited in 2 Reviews
Cited in 16 Documents

MSC:

90C10 Integer programming
68Q25 Analysis of algorithms and problem complexity

Keywords:

Computational Complexity; Integer Programming; Np-Complete Problems; Knapsack Problem

Citations:

Zbl 0392.00015
Cite Review PDF