Article
Licensed
Unlicensed
Requires Authentication
Asymptotically exact polynomial algorithms in integer linear programming
-
N. N. KUZYURIN
Published/Copyright:
October 8, 2009
Published Online: 2009-10-08
Published in Print: 1991
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Reconstruction of sequential machines by experiments
- On some specific properties of realization of finite-sequential functions by circuits consisting of unreliable elements
- On the number of antichains in multilevelled ranked posets
- Asymptotically exact polynomial algorithms in integer linear programming
- On the number of permutations with constraints on their cycle lengths
- The number and cycle structure of solutions of a system of equations in substitutions
- On the conditions of asymptotic normality of multidimensional randomized decomposable statistics
Articles in the same Issue
- Reconstruction of sequential machines by experiments
- On some specific properties of realization of finite-sequential functions by circuits consisting of unreliable elements
- On the number of antichains in multilevelled ranked posets
- Asymptotically exact polynomial algorithms in integer linear programming
- On the number of permutations with constraints on their cycle lengths
- The number and cycle structure of solutions of a system of equations in substitutions
- On the conditions of asymptotic normality of multidimensional randomized decomposable statistics