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 ...

This is a preview. Log in through your library . Abstract Column aggregation of 0/1 programming problems is considered. By relaxing the integer requirements in the aggregated problem, an easy problem ...

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 ...