Abstract Large Neighborhood Search (LNS) heuristics are among the most powerful but also expensive for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS work best MIP problem at hand. To this end, introduces Adaptive (ALNS) MIP, primal heuristic that acts as framework eight popular such Local Branching and Relaxation I...

We introduce a mixed integer program (MIP) for assigning importance scores to each neuron in deep neural network architectures which is guided by the impact of their simultaneous pruning on main learning task network. By carefully devising objective function MIP, we drive solver minimize number critical neurons (i.e., with high score) that need be kept maintaining overall accuracy trained Furth...

over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. these aspects are the economic, the environmental, the social and the safety aspects. in the vehicle routing problem (vrp) literature, the economic issue has often been used, while the environmen...

in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...