Branching on nonchimerical fractionalities

DOI10.1016/j.orl.2012.01.008zbMath1245.90068OpenAlexW2153328028MaRDI QIDQ439902

Matteo Fischetti, Michele Monaci

Publication date: 17 August 2012

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

Full work available at URL: https://doi.org/10.1016/j.orl.2012.01.008

zbMATH Keywords

computational experimentsbranch-and-boundstrong branching

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (4)

A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference ⋮ On learning and branching: a survey ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ Improving strong branching by domain propagation

Uses Software

• SCIP
• MIPLIB

Cites Work

• Faster integer-feasibility in mixed-integer linear programs by branching to force change
• SCIP: solving constraint integer programs
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Branching rules revisited
• Information-based branching schemes for binary linear mixed integer problems
• Conflict analysis in mixed integer programming
• Backdoor Branching
• Backdoors to Combinatorial Optimization: Feasibility and Optimality
• A Computational Study of Search Strategies for Mixed Integer Programming
• Experiments in mixed-integer linear programming

This page was built for publication: Branching on nonchimerical fractionalities