PUSH: a primal heuristic based on Feasibility PUmp and SHifting

07/30/2022
by   Giorgio Grani, et al.
0

This work describes PUSH, a primal heuristic combining Feasibility Pump and Shifting. The main idea is to replace the rounding phase of the Feasibility Pump with a suitable adaptation of the Shifting and other rounding heuristics. The algorithm presents different strategies, depending on the nature of the partial rounding obtained. In particular, we distinguish when the partial solution is feasible, infeasible with potential candidates, and infeasible without candidates. We used a threshold to indicate the percentage of variables to round with our algorithm and which other to round to the nearest integer. Most importantly, our algorithm tackles directly equality constraints without duplicating rows. We select the parameters of our algorithm on the 19 instances provided for the Mip Competition 2022. Finally, we compared our approach to other start heuristics, like Simple Rounding, Rounding, Shifting, and Feasibility Pump on the first 800 MIPLIB2017 instances ordered by the number of non-zeros.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2019

A feasibility pump algorithm embedded in an annealing framework

The feasibility pump algorithm is an efficient primal heuristic for find...
research
10/10/2018

A Fast Polynomial-time Primal-Dual Projection Algorithm for Linear Programming

Traditionally, there are several polynomial algorithms for linear progra...
research
06/04/2022

Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP

We present a solver for Mixed Integer Programs (MIP) developed for the M...
research
02/15/2022

Confidence Threshold Neural Diving

Finding a better feasible solution in a shorter time is an integral part...
research
10/15/2012

Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study

This paper proposes a method for construction of approximate feasible pr...
research
01/31/2013

Efficient Partial Order CDCL Using Assertion Level Choice Heuristics

We previously designed Partial Order Conflict Driven Clause Learning (PO...
research
07/03/2023

Density-based Feasibility Learning with Normalizing Flows for Introspective Robotic Assembly

Machine Learning (ML) models in Robotic Assembly Sequence Planning (RASP...

Please sign up or login with your details

Forgot password? Click here to reset