Branching on nonchimerical fractionalities
From MaRDI portal
Publication:439902
DOI10.1016/J.ORL.2012.01.008zbMATH Open1245.90068OpenAlexW2153328028MaRDI QIDQ439902FDOQ439902
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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- SCIP: solving constraint integer programs
- A Computational Study of Search Strategies for Mixed Integer Programming
- Branching rules revisited
- Conflict analysis in mixed integer programming
- Backdoor Branching
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- 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
- Backdoors to Combinatorial Optimization: Feasibility and Optimality
Cited In (6)
- On learning and branching: a survey
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Branching rules revisited
- Improving strong branching by domain propagation
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
Uses Software
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)
