Improving the feasibility pump

DOI10.1016/j.disopt.2006.10.004zbMath1170.90443OpenAlexW2050613227MaRDI QIDQ2471276

Publication date: 22 February 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.004

zbMATH Keywords

mixed integer programming feasibility pump primal heuristics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Column Generation based Primal Heuristics, Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility, Three ideas for a feasibility pump for nonconvex MINLP, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Recursive central rounding for mixed integer programs, Fix-and-relax approaches for controlled tabular adjustment, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, Redundancy system design for an aircraft door management system, Inexact feasibility pump for mixed integer nonlinear programming, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Mathematical programming based heuristics for the 0--1 MIP: a survey, A storm of feasibility pumps for nonconvex MINLP, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, A feasible rounding approach for mixed-integer optimization problems, A matheuristic for tri-objective binary integer linear programming, A learn‐and‐construct framework for general mixed‐integer programming problems, The Chebyshev center as an alternative to the analytic center in the feasibility pump, Using the analytic center in the feasibility pump, Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization, Adaptive kernel search: a heuristic for solving mixed integer linear programs, A hybrid primal heuristic for finding feasible solutions to mixed integer programs, Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications, Improving the Randomization Step in Feasibility Pump, An interior point cutting plane heuristic for mixed integer programming, A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times, Feasibility Pump-like heuristics for mixed integer problems, A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Heuristics of the Branch-Cut-and-Price-Framework SCIP, Repairing MIP infeasibility through local branching, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Boosting the feasibility pump, A feasibility pump heuristic for general mixed-integer problems, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, A computational study of primal heuristics inside an MI(NL)P solver, Proximity search for 0--1 mixed-integer convex programming, Shift-and-propagate, A primal heuristic for optimizing the topology of gas networks based on dual information, A computational study of parametric tabu search for 0-1 mixed integer programs, A proximal-point outer approximation algorithm, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem, Hybrid heuristics for a short sea inventory routing problem, SCIP: solving constraint integer programs, A simple effective heuristic for embedded mixed-integer quadratic programming, Structure-driven fix-and-propagate heuristics for mixed integer programming, Feasibility pump algorithm for sparse representation under Laplacian noise, RENS. The optimal rounding, A feasibility pump for mixed integer nonlinear programs, Modeling and solving a bi-objective airport slot scheduling problem, Granularity in nonlinear mixed-integer optimization, Improving the performance of DICOPT in convex MINLP problems using a feasibility pump, A constraints-aware reweighted feasibility pump approach, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Improving Benders decomposition using a genetic algorithm, Feasibility pump 2.0, Ten years of feasibility pump, and counting, FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming, Generalized relax-and-fix heuristic, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, Towards an objective feasibility pump for convex minlps

Uses Software

Cites Work