A combined variable aggregation presolving technique for mixed integer programming

DOI10.1016/j.orl.2024.107074MaRDI QIDQ6564293

Jianhua Yuan, Houshan Zhang

Publication date: 1 July 2024

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

zbMATH Keywords

mixed integer programmingsemi-continuous variablesvariable aggregationpresolving methods

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• A polyhedral study of production ramping
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
• SCIP: solving constraint integer programs
• Progress in presolving for mixed integer programming
• Optimal planning in large multi-site production networks
• Presolving in linear programming
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods
• MIPLIB 2003
• Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
• Presolve Reductions in Mixed Integer Programming
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• Mixed Integer Programming: Analyzing 12 Years of Progress
• Efficient presolving methods for solving maximal covering and partial set covering location problems

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