Information-based branching schemes for binary linear mixed integer problems
From MaRDI portal
Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Recommendations
- An abstract model for branching and its application to mixed integer programming
- Further results on an abstract model for branching and its application to mixed integer programming
- Information-theoretic approaches to branching in search
- Branching rules revisited
- Measuring the impact of branching rules for mixed-integer programming
Cites work
- A Computational Study of Search Strategies for Mixed Integer Programming
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Benchmarking optimization software with performance profiles.
- Branching on general disjunctions
- Branching rules revisited
- Conflict analysis in mixed integer programming
- Efficient intelligent backtracking using linear programming
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
- Experiments in mixed-integer linear programming
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- scientific article; zbMATH DE number 1114456 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- Identifying Minimally Infeasible Subsystems of Inequalities
- Improved strategies for branching on general disjunctions
- Information-theoretic approaches to branching in search
- MINTO, a Mixed INTeger Optimizer
- MIPLIB 2003
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- On the solution of traveling salesman problems
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem
- Resolution search
- SCIP: solving constraint integer programs
Cited in
(24)- An abstract model for branching and its application to mixed integer programming
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A relax-and-cut framework for Gomory mixed-integer cuts
- Rounding-based heuristics for nonconvex MINLPS
- Experiments with conflict analysis in mixed integer programming
- Computational aspects of infeasibility analysis in mixed integer programming
- Further results on an abstract model for branching and its application to mixed integer programming
- Faster MIP solutions via new node selection rules
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- On learning and branching: a survey
- Improving strong branching by domain propagation
- Backdoor branching
- Information-theoretic approaches to branching in search
- Branching on nonchimerical fractionalities
- Measuring the impact of branching rules for mixed-integer programming
- Conflict Analysis for MINLP
- Enhancing MIP branching decisions by using the sample variance of pseudo costs
- Comments on: ``On learning and branching: a survey
- On interval-subgradient and no-good cuts
- One-shot learning for MIPs with SOS1 constraints
- Last fifty years of integer linear programming: a focus on recent practical advances
- Restrict-and-relax search for 0-1 mixed-integer programs
- An enhanced logical benders approach for linear programs with complementarity constraints
This page was built for publication: Information-based branching schemes for binary linear mixed integer problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267352)
