Combining problem structure with basis reduction to solve a class of hard integer programs

Mathematics of Operations Research

Volumn 27, Issue 3, 2002, Pages 470-484

  Louveaux, Quentin ^a   Wolsey, Laurence A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Basis reduction; Integer programming; Lattices; Market share problem

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

POLYNOMIAL ALGORITHMS;

INTEGER PROGRAMMING;

EID: 0036672663     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.3.470.315     Document Type: Article

References (12)

1. Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances
2. Solving a system of linear diophantine equations with lower and upper bounds on the variables
3. The theory of matrices, 2nd ed
4. Factoring polynomials with rational coefficients
5. Résolution de problèmes d'optimisation en nombres entiers par un algorithme de réduction de base dans les treillis
6. Integral matrices