Information-based branching schemes for binary linear mixed integer problems
From MaRDI portal
Publication:2267352
DOI10.1007/s12532-009-0009-1zbMath1184.90114OpenAlexW2156987683MaRDI QIDQ2267352
Fatma Kılınç-Karzan, Nemhauser, George I., Savelsbergh, Martin W. P.
Publication date: 1 March 2010
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-009-0009-1
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Cutting plane versus compact formulations for uncertain (integer) linear programs, On learning and branching: a survey, On interval-subgradient and no-good cuts, Branching on nonchimerical fractionalities, Backdoor Branching, 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, A branch-and-cut algorithm for mixed-integer bilinear programming, Improving strong branching by domain propagation, Restrict-and-relax search for 0-1 mixed-integer programs, Computational aspects of infeasibility analysis in mixed integer programming, Conflict Analysis for MINLP, An enhanced logical benders approach for linear programs with complementarity constraints, Comments on: ``On learning and branching: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Information-theoretic approaches to branching in search
- Branching on general disjunctions
- Improved strategies for branching on general disjunctions
- Resolution search
- SCIP: solving constraint integer programs
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- On the solution of traveling salesman problems
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- MINTO, a Mixed INTeger Optimizer
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Branching rules revisited
- MIPLIB 2003
- Conflict analysis in mixed integer programming
- Efficient Intelligent Backtracking Using Linear Programming
- Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem
- Identifying Minimally Infeasible Subsystems of Inequalities
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- A Computational Study of Search Strategies for Mixed Integer Programming
- Experiments in mixed-integer linear programming
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
- Benchmarking optimization software with performance profiles.
