On reduction integer programs to knapsack problem

Simple item page
dc.creatorVeselov, S. I.
dc.date2008-06-24
dc.date.accessioned2026-07-07T09:46:24Z
dc.date.available2026-07-07T09:46:24Z
dc.descriptionLet $A$ be an integral nonnegative $m\times n$ matrix, $b$ be an integral nonnegative vector. It is suggested new method for reduction of integer program $\max \{cx| Ax=b, x\ge 0, x\in\mathbf{Z}^n\}$ to knapsack problem $\max \{c'x| fAx=fb, x\ge 0, x\in\mathbf{Z}^n\}$.
dc.identifierhttps://arxiv.org/abs/0806.3853
dc.identifierhttp://arxiv.org/abs/0806.3853
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163518
dc.subjectOptimization and Control
dc.titleOn reduction integer programs to knapsack problem
dc.typetext

Files

Collections

arXiv