In this work, we study exact continuous reformulations of nonlinear integer programming problems. To this aim, we preliminarily state conditions to guarantee the equivalence between pairs of general nonlinear problems. Then, we prove that optimal solutions of a nonlinear integer programming...

Mixed-Integer optimization represents a powerful tool for modelling many optimization problems arising from real-world applications. The Feasibility pump is a heuristic for finding feasible solutions to mixedinteger linear problems. In this work, we propose a new feasibility pump approach for...

In this work, we propose a global optimization approach for mixed-integer programming problems. To this aim, we preliminarily define an exact penalty algorithm model for globally solving general problems and we show its convergence properties. Then, we describe a particular version of the...

Mixed-Integer optimization represents a powerful tool for modeling manyoptimization problems arising from real-world applications. The Feasibilitypump is a heuristic for finding feasible solutions to mixed integer linear problems. In this work, we propose a new feasibility pump approach using...

Mixed-Integer optimization is a powerful tool for modeling many optimization problems arising from real-world applications. Finding a rst feasible solution represents the rst step for several MIP solvers. The Feasibility pump is a heuristic for nding feasible solutions to mixed integer linear...