On the asymptotic integer algorithm

DOI10.1016/0024-3795(70)90001-7zbMath0196.22704OpenAlexW2047176656MaRDI QIDQ2539522

Yanyan Li

Publication date: 1970

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(70)90001-7

zbMATH Keywords

operations research

Related Items (5)

Computational experience with a group theoretic integer programming algorithm ⋮ Copositive realxation for genera quadratic programming ⋮ An extension of Hu's group minimization algorithm ⋮ Testing integer knapsacks for feasibility ⋮ Part I-Smith form and common divisor of polynomial matrices

Cites Work

• Some polyhedra related to combinatorial problems
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Unnamed Item

This page was built for publication: On the asymptotic integer algorithm