Constraint violation reduction search for 0–1 mixed integer linear programming problems

DOI10.1080/0305215X.2020.1742710MaRDI QIDQ6094312zbMATH OpenOpenAlexFDO

Authors Ankit Bansal, Reha Uzsoy

Publication date 10 October 2023

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2020.1742710

zbMATH Keywords

capacitated warehouse locationprimal heuristicresource constrained project scheduling

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
• New variable neighborhood search based 0-1 MIP heuristics
• Variable neighborhood search and local branching
• Proximity search for 0--1 mixed-integer convex programming

This page was built for publication: Constraint violation reduction search for 0–1 mixed integer linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094312)