The feasibility pump

From MaRDI portal

Publication:2571001

Jump to:navigation, search

DOI10.1007/s10107-004-0570-3zbMath1077.90039OpenAlexW2127022339MaRDI QIDQ2571001

Andrea Lodi, Fred Glover, Matteo Fischetti

Publication date: 31 October 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0570-3

zbMATH Keywords

feasible solution generic MIP problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Improving branch-and-cut performance by random sampling, 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, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Inversion of convection-diffusion equation with discrete sources, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, A supervised learning-driven heuristic for solving the facility location and production planning problem, Achieving MILP feasibility quickly using general disjunctions, Recursive central rounding for mixed integer programs, The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach, Fix-and-relax approaches for controlled tabular adjustment, The green capacitated multi-item lot sizing problem with parallel machines, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines, An exact algorithm for biobjective mixed integer linear programming problems, Inexact feasibility pump for mixed integer nonlinear programming, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Improving the Cook et al. proximity bound given integral valued constraints, Mathematical programming based heuristics for the 0--1 MIP: a survey, Modeling and solving the mixed capacitated general routing problem, A recipe for finding good solutions to MINLPs, A storm of feasibility pumps for nonconvex MINLP, Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization, Convex analysis in groups and semigroups: a sampler, A decomposition heuristic for mixed-integer supply chain problems, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, A feasible rounding approach for mixed-integer optimization problems, Online Mixed-Integer Optimization in Milliseconds, Integral Column Generation for Set Partitioning Problems with Side Constraints, Using the analytic center in the feasibility pump, Adaptive kernel search: a heuristic for solving mixed integer linear programs, A hybrid primal heuristic for finding feasible solutions to mixed integer programs, Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization, Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs, Improving the Randomization Step in Feasibility Pump, Faster integer-feasibility in mixed-integer linear programs by branching to force change, An interior point cutting plane heuristic for mixed integer programming, Heuristics for convex mixed integer nonlinear programs, A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times, Variable neighborhood search: basics and variants, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, Solving Multiobjective Mixed Integer Convex Optimization Problems, Feasibility Pump-like heuristics for mixed integer problems, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Repairing MIP infeasibility through local branching, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, Boosting the feasibility pump, Generalized local branching heuristics and the capacitated ring tree problem, On the strength of Gomory mixed-integer cuts as group cuts, A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, 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, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A multi-item approach to repairable stocking and expediting in a fluctuating demand environment, A heuristic approach for big bucket multi-level production planning problems, The search-and-remove algorithm for biobjective mixed-integer linear programming problems, Proximity search for 0--1 mixed-integer convex programming, Shift-and-propagate, Polylithic modeling and solution approaches using algebraic modeling systems, HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry, MIP formulations and heuristics for two-level production-transportation problems, Rounding-based heuristics for nonconvex MINLPS, A primal heuristic for optimizing the topology of gas networks based on dual information, ZI round, a MIP rounding heuristic, A computational study of parametric tabu search for 0-1 mixed integer programs, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, A proximal-point outer approximation algorithm, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, Feasibility pump for aircraft deconfliction with speed regulation, Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem, Preprocessing and cutting planes with conflict graphs, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, A dual heuristic for mixed integer programming, Hybrid heuristics for a short sea inventory routing problem, Mixed-integer optimal control under minimum dwell time constraints, Structure-driven fix-and-propagate heuristics for mixed integer programming, Restrict-and-relax search for 0-1 mixed-integer programs, 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, Cut generation for an integrated employee timetabling and production scheduling problem, Decomposition, reformulation, and diving in university course timetabling, Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems, 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, Integer-programming software systems, Towards an objective feasibility pump for convex minlps, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, Matheuristics: survey and synthesis, Optimization bounds from decision diagrams in Haddock, A matheuristic for tri-objective binary integer linear programming, A learn‐and‐construct framework for general mixed‐integer programming problems, A recombination‐based matheuristic for mixed integer programming problems with binary variables, Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem, A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach, The Chebyshev center as an alternative to the analytic center in the feasibility pump, A Gauss-Newton-based decomposition algorithm for nonlinear mixed-integer optimal control problems, A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs, Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization, Efficient enumeration of the optimal solutions to the correlation clustering problem, Variable neighborhood search: the power of change and simplicity, A branch and bound algorithm for robust binary optimization with budget uncertainty, Feasibility jump: an LP-free Lagrangian MIP heuristic, 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, Heuristics of the Branch-Cut-and-Price-Framework SCIP, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Primal Heuristics for Branch-and-Price Algorithms, A simple effective heuristic for embedded mixed-integer quadratic programming

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2571001&oldid=15325979"