Technical Note—An Improved Branch-and-Bound Method for Integer Programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3908168
- The reduced cost branch and bound algorithm for mixed integer programming
- scientific article; zbMATH DE number 1312984
- An Improved Implicit Enumeration Approach for Integer Programming
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
Cited in
(42)- Facility location models for distribution planning
- The reduced cost branch and bound algorithm for mixed integer programming
- A heuristic for multiple choice programming
- A possible way to reduce degeneracy in integer programming computations
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- Modified branch-and-bound method for solving a series of problems
- Parametric integer linear programming: A synthesis of branch and bound with cutting planes
- An intelligent algorithm for mixed-integer programming models
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
- Penalty computations for the set partitioning problem
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A bound-improving approach to discrete programming problems
- Links between linear bilevel and mixed 0-1 programming problems
- A new bounding technique in branch-and-bound algorithms for mixed integer programming
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Improved sorting-based procedure for integer programming
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Incumbent solutions in branch-and-bound algorithms: Setting the record straight
- Conflict graphs in solving integer programming problems
- A modification of a method for a class of problems in integer programming
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration
- The ray-method: theoretical background and computational results
- A bounded dual (all-integer) integer programming algorithm with an objective cut
- Determining initial bound by ``ray-method in branch and bound procedure
- scientific article; zbMATH DE number 3908168 (Why is no real title available?)
- Recursive branch and bound
- Sensitivity Analysis for Branch and Bound Integer Programming
- scientific article; zbMATH DE number 3974726 (Why is no real title available?)
- scientific article; zbMATH DE number 4053356 (Why is no real title available?)
- An improved enumeration for pure 0-1 programs
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
- Some computationally relevant group theoretic structures of fixed charge problems
- scientific article; zbMATH DE number 1287781 (Why is no real title available?)
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- Trivial integer programs unsolvable by branch-and-bound
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Improvement of FPPR method to solve ECDLP
- Branch and bound with estimation based on pseudo-shadow-prices
- A method to improve integer linear programming problem with branch-and-bound procedure
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
This page was built for publication: Technical Note—An Improved Branch-and-Bound Method for Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5624983)
