Cargando…
Qualitative topics in integer linear programming
Integer solutions for systems of linear inequalities, equations, and congruences are considered along with the construction and theoretical analysis of integer programming algorithms. The complexity of algorithms is analyzed dependent upon two parameters: the dimension, and the maximal modulus of th...
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
1996
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2713795 |