An implicit branch-and-bound algorithm for mixed-integer linear programming
From MaRDI portal
The authors present a branch-and-bound algorithm for solving the general mixed-integer linear programming problem of the form max \(c^ Tx\), subject to \(Ax=b\), \(x\geq 0\) and \(x_ j\) integer for \(j\in I\). Some numerical results are given.
Recommendations
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A branch and bound method for the solution of multiparametric mixed integer linear programming problems
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- A branch-and-bound algorithm for 0-1 parametric mixed integer programming
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A new bounding technique in branch-and-bound algorithms for mixed integer programming
- scientific article; zbMATH DE number 1488891
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
Cites work
- A primal-dual cutting-plane algorithm for all-integer programming
- A Simplified Primal (All-Integer) Integer Programming Algorithm
- A tree-search algorithm for mixed integer programming problems
- An advanced dual algorithm with constraint relaxation for all-integer programming
- An advanced start algorithm for all-integer programming
- An Automatic Method of Solving Discrete Programming Problems
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 4045470 (Why is no real title available?)
- Integer Linear Programming: A Study in Computational Efficiency
- Outline of an algorithm for integer solutions to linear programs
- The mixed cutting plane algorithm for all-integer programming
Cited in
(16)- The reduced cost branch and bound algorithm for mixed integer programming
- An approximate method for local optima for nonlinear mixed integer programming problems
- An intelligent algorithm for mixed-integer programming models
- A new global approach for \(0\)-\(1\) polynomial programs
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A global approach for general 0-1 fractional programming
- A new bounding technique in branch-and-bound algorithms for mixed integer programming
- A combinatorial branch-and-bound algorithm for box search
- Solving a problem of the choice of products by means of the branch and bound method
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- scientific article; zbMATH DE number 4018774 (Why is no real title available?)
- scientific article; zbMATH DE number 29203 (Why is no real title available?)
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
- scientific article; zbMATH DE number 1406243 (Why is no real title available?)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Resolution search
This page was built for publication: An implicit branch-and-bound algorithm for mixed-integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804472)
