Rounding heuristic for integer linear programs

DOI10.1007/978-3-031-90510-0_23MaRDI QIDQ7324802zbMATH OpenFDO

Authors Abdelkrim Rezzag, Mohand Ouamer Bibi, Hacene Ouzia

Publication date 4 September 2026

Full work available at URL https://doi.org/10.1007/978-3-031-90510-0_23

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A combined variable aggregation presolving technique for mixed integer programming
• A feasibility pump heuristic for general mixed-integer problems
• Conflict-Driven Heuristics for Mixed Integer Programming
• Presolve Reductions in Mixed Integer Programming
• Proximity search for 0--1 mixed-integer convex programming
• RENS. The optimal rounding
• Rounding and propagation heuristics for mixed integer programming

This page was built for publication: Rounding heuristic for integer linear programs

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