Improving the Randomization Step in Feasibility Pump

@article{Dey2016ImprovingTR,
  title={Improving the Randomization Step in Feasibility Pump},
  author={Santanu S. Dey and Andr{\'e}s Iroum{\'e} and Marco S. Molinaro and Domenico Salvagnin},
  journal={SIAM J. Optim.},
  year={2016},
  volume={28},
  pages={355-378}
}
Feasibility pump (FP) is a successful primal heuristic for mixed-integer linear programs (MILP). The algorithm consists of three main components: rounding fractional solution to a mixed-integer one, projection of infeasible solutions to the LP relaxation, and a randomization step used when the algorithm stalls. While many generalizations and improvements to the original Feasibility Pump have been proposed, they mainly focus on the rounding and projection steps. We start a more in-depth study… 

Tables from this paper

A feasibility pump algorithm embedded in an annealing framework

This paper designs a two-stage approach that embeds the feasibility pump heuristic into an annealing framework and demonstrates the superiority of the new approach over Feasibility Pump 2.0.

Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump

This paper considers the usage of multiple integer reference vectors in all stages of the Feasibility Pump algorithm to explore further optimizing directions and in-troduce alternative objective scaling terms to balance the contributions of the distance functions and the original MIP objective.

Ten years of feasibility pump, and counting

An overview of the diverse Feasibility Pump literature that has been presented over the last decade is provided.

Structure-driven fix-and-propagate heuristics for mixed integer programming

This paper presents a scheme for start heuristics that can be executed without previous knowledge of an LP solution or a previously found integer feasible solution, which uses global structures available within MIP solvers to iteratively fix integer variables and propagate these fixings.

Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps

A convergence theory for the new penalty based alternating direction method is presented and a novel penalty framework is proposed that allows us to refrain from random perturbations that are applied in standard versions of feasibility pumps in case of failure.

Feasibility Pump Algorithm for Sparse Representation under Laplacian Noise

The Feasibility Pump recovers the sparse representation of signals affected by Laplacian noise with good accuracy while using a very small computation time when compared with other mixed integer methods.

Feasibility Pump Algorithm for Sparse Representation under Gaussian Noise

The Feasibility Pump is adapted for the problem of sparse representations of signals affected by Gaussian noise and, as the SNR decreases and the support size increases, it has a smaller recovery and representation error when compared with its competitors.

References

SHOWING 1-10 OF 24 REFERENCES

Feasibility pump 2.0

This paper investigates the use of a diving-like procedure based on rounding and constraint propagation—a basic tool in Constraint Programming, and shows that the new approach produces a substantial improvement of the FP success rate.

Boosting the feasibility pump

This work investigates the benefits of enhancing the rounding procedure with a clever integer line search that efficiently explores a large set of integer points and demonstrates the efficacy of the proposed approach.

A storm of feasibility pumps for nonconvex MINLP

A remarkable twist of feasibility pump algorithms is that, unlike most previous successive projection methods from the literature, projection is “naturally” taken in two different norms in the two different subproblems.

A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach

This work starts by interpreting the Feasibility Pump as a Frank-Wolfe method applied to a nonsmooth concave merit function, and identifies some merit functions belonging to this class and dene a general class of functions that can be included in the FeAsibility Pump scheme for measuring solution integrality.

Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps

A convergence theory for the new penalty based alternating direction method is presented and a novel penalty framework is proposed that allows us to refrain from random perturbations that are applied in standard versions of feasibility pumps in case of failure.

The feasibility pump

The outcome is that FP, in spite of its simple foundation, proves competitive with ILOG-Cplex both in terms of speed and quality of the first solution delivered.

Constraint integer programming

This thesis deals with chip design verification, which is an important topic of electronic design automation, and shows how this problem can be modeled as constraint integer program and provide a number of problem-specific algorithms that exploit the structure of the individual constraints and the circuit as a whole.

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs

Borders on the ratio of $z^{cut}$ and the optimal objective function value of the MILP that depends only on the sparsity structure of the constraint matrix and the support of sparse cuts selected are presented, that is, these bounds are completely data independent.