A combined variable aggregation presolving technique for mixed integer programming

DOI10.1016/J.ORL.2024.107074MaRDI QIDQ6564293zbMATH OpenFDO

Authors Houshan Zhang, Jianhua Yuan

Publication date 1 July 2024

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107074

zbMATH Keywords

mixed integer programmingsemi-continuous variablesvariable aggregationpresolving methods

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 2084777 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• A polyhedral study of production ramping
• Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
• Efficient presolving methods for solving maximal covering and partial set covering location problems
• MIPLIB 2003
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Mixed integer programming: analyzing 12 years of progress
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• Optimal planning in large multi-site production networks
• Presolve Reductions in Mixed Integer Programming
• Presolving in linear programming
• Progress in presolving for mixed integer programming
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
• SCIP: solving constraint integer programs
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods

Cited in

(2)

• A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
• A combined linear and nonlinear presolve for nonlinear optimization

This page was built for publication: A combined variable aggregation presolving technique for mixed integer programming

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