×
Kannan, Ravindran

Polynomial-time aggregation of integer programming problems. (English) Zbl 0512.90075

J. Assoc. Comput. Mach. 30, 133-145 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0512.90075

Cited in 11 Documents

MSC:

90C10 Integer programming
11D04 Linear Diophantine equations
68Q25 Analysis of algorithms and problem complexity
90C05 Linear programming

Keywords:

NP-completeness; polynomial-time algorithm; knapsack problem; aggregation of linear Diophantine equations

Citations:

Zbl 0293.15018
Cite Review PDF
Full Text: DOI