The integral basis method for integer programming

  title={The integral basis method for integer programming},
  author={Utz-Uwe Haus and Matthias K{\"o}ppe and Robert Weismantel},
  journal={Mathematical Methods of Operations Research},
Abstract. This paper introduces an exact algorithm for solving integer programs, neither using cutting planes nor enumeration techniques. It is a primal augmentation algorithm that relies on iteratively substituting one column by columns that correspond to irreducible solutions of certain linear diophantine inequalities. We demonstrate the algorithm's potential by testing it on some instances of the MIPLIB with up to 6000 variables. 

A primal all-integer algorithm based on irreducible solutions

An exact primal augmentation algorithm for solving general linear integer programs that iteratively substitutes one column in a tableau by other columns that correspond to irreducible solutions of certain linear diophantine inequalities is introduced.

Polynomial Time Primal Integer Programming via Graver Bases

We describe recent developments in primal methods for integer programming which lead to the polynomial time solution of new broad classes of integer programming problems with linear and various

An algorithm for mixed integer optimization

A new algorithm for solving mixed integer programs that is an iterative technique for changing the representation of the original mixed integer optimization problem.

Primal cutting plane algorithms revisited

A new primal algorithm for pure 0-1 problems based on strong valid inequalities is described and some encouraging computational results are given.

Primal Integer Programming

The Integral Basis Method in an Augmentation Framework for Integer Programming

One of the obstacles in a branch-and-cut IP-solving scheme is closing the gap between a known feasible solution and the solution(s) to LP relaxations of the problem. There are, however, a number of

Integer Pivoting Revisited

The approach of integer pivoting is recalled and the family of Gomory-Young augmenta tion vectors that can be derived from a simplex tableau is introduced and a technique of co mbining Gomary-Young vectors and combinatorial augmentation vectors in one augm entation scheme is presented.

Exponential irreducible neighborhoods for combinatorial optimization problems

Families of irreducible vectors of exponential size, derived from alternating cycles, where optimizing a linear function over each of these families can be done in polynomial time are studied.

Strong formulations for mixed integer programs: valid inequalities and extended formulations

Examining progress over the last fifteen years in finding strong valid inequalities and tight extended formulations for simple mixed integer sets lying both on the ``easy'' and ``hard'' sides of the complexity frontier concludes by citing briefly some of the more intriguing new avenues of research.



Integer Programming with a Fixed Number of Variables

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.

A Primal Analogue of Cutting Plane

It is shown that every phase of a primal method has a natural analogue in cutting plane algorithms, and an augmentation network for the intersection of any two integer programs is introduced that gives rise to an algorithmic characterization of the weighted bipartite b-matching problem.

A Simplified Primal (All-Integer) Integer Programming Algorithm

The simplified primal algorithm makes these major amendments to the simplex method: a special row, indexed by L, is adjoined to the tableau and is periodically revised by a well-defined procedure.

On the Set-Covering Problem: II. An Algorithm for Set Partitioning

In the paper the authors give a constructive characterization of adjacency relations between integer vertices of the feasible set, which enables them to generate edges connecting a given integer vertex to adjacentinteger vertices, which helps overcome the difficulties caused by degeneracy and leads to a class of algorithms.

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

This study uses the algorithm of Aardal, Hurkens, and Lenstra (1998) based on lattice basis reduction as a general method for solving systems of linear diophantine equations with bounds on the variables for market split instances.

Integer Programming and Network Flows

Interestingly, integer programming and network flows that you really wait for now is coming. It's significant to wait for the representative and beneficial books to read. Every book that is provided

Factoring polynomials with rational coefficients

In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into

van der Corput,̈ Uber Systeme von linearhomogenen Gleichungen und Ungleichungen

  • Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam

Uber Systeme von linear-homogenen Gleichungen und Ungleichungen

  • Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam
  • 1931