We are concerned with the problem of minimizing the supremum norm on an interval of a nonzero polynomial of degree at most n with integer coefficients. This is an old and hard problem that cannot be ...

The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...

This is a preview. Log in through your library . Abstract In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane ...