Branching on nonchimerical fractionalities

DOI10.1016/J.ORL.2012.01.008MaRDI QIDQ439902zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An abstract model for branching and its application to mixed integer programming
• Improved strategies for branching on general disjunctions
• Branching rules revisited
• A variable depth search branching
• Faster integer-feasibility in mixed-integer linear programs by branching to force change

Cites work

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

Cited in

(15)

• Measuring the impact of branching rules for mixed-integer programming
• On learning and branching: a survey
• Last fifty years of integer linear programming: a focus on recent practical advances
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• Information-theoretic approaches to branching in search
• A branch-and-cut algorithm for mixed-integer bilinear programming
• Branching on multi-aggregated variables
• A variable depth search branching
• Branching rules revisited
• How important are branching decisions: fooling MIP solvers
• Cloud branching
• Faster integer-feasibility in mixed-integer linear programs by branching to force change
• An abstract model for branching and its application to mixed integer programming
• Improving strong branching by domain propagation
• A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference

Describes a project that uses

Uses Software

• MIPLIB
• SCIP

This page was built for publication: Branching on nonchimerical fractionalities

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