Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs

DOI10.1007/978-3-319-18008-3_14zbMath1464.90042OpenAlexW756107699MaRDI QIDQ5741467

Gregor Hendel

Publication date: 25 July 2016

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18008-3_14

zbMATH Keywords

strong branching look-aheads on variables, two-sample Student's \(t\)-test

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Transferring information across restarts in MIP ⋮ From feasibility to improvement to proof: three phases of solving mixed-integer programs

Uses Software

• SCIP
• SoPlex
• MIPLIB
• CPLEX
• Gurobi
• XPRESS
• MIPLIB2003

This page was built for publication: Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs