Generalized relax-and-fix heuristic
type: Item
instance of: scholarly article
title: Generalized relax-and-fix heuristic
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634080
zbMATH Keywords: heuristics
zbMATH Keywords: mixed-integer linear and non linear programming
zbMATH Keywords: relaxed problem
describes a project that uses: FEASPUMP
describes a project that uses: Octane
describes a project that uses: BPPLIB
describes a project that uses: POPMUSIC
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106038
OpenAlex ID: W4297359432
cites work: Improving the feasibility pump
cites work: A heuristic approach for big bucket multi-level production planning problems
cites work: Octane: A New Heuristic for Pure 0–1 Programs
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: Pivot and shift -- a mixed integer programming heuristic
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: Measuring the impact of primal heuristics
cites work: RENS. The optimal rounding
cites work: Undercover: a primal MINLP heuristic exploring a largest sub-MIP
cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
cites work: A feasibility pump for mixed integer nonlinear programs
cites work: A storm of feasibility pumps for nonconvex MINLP
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: A hybrid primal heuristic for finding feasible solutions to mixed integer programs
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: On practical resource allocation for production planning and scheduling with period overlapping setups
cites work: On a fix-and-relax framework for a class of project scheduling problems
cites work: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
cites work: The feasibility pump
cites work: Local branching
cites work: Proximity search for 0--1 mixed-integer convex programming
cites work: A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
cites work: Structure-driven fix-and-propagate heuristics for mixed integer programming
cites work: Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
cites work: A result on projection for the vehicle routing problem
cites work: Restrict-and-relax search for 0-1 mixed-integer programs
cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior
cites work: Column generation based primal heuristics
cites work: Projection results for vehicle routing
cites work: An optimal algorithm for the multi-item capacitated production planning problem
cites work: Q5617409
cites work: A generic exact solver for vehicle routing and related problems
cites work: Production Planning by Mixed Integer Programming
cites work: A POPMUSIC matheuristic for the capacitated vehicle routing problem
cites work: Primal Heuristics for Branch and Price: The Assets of Diving Methods
cites work: Towards an objective feasibility pump for convex minlps
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: POPMUSIC -- partial optimization metaheuristic under special intensification conditions
cites work: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
cites work: Using and extending fix-and-relax to solve maritime inventory routing problems
DOI: 10.1016/J.COR.2022.106038
description: scientific article; zbMATH DE number 7634080