Mixed integer programming: A historical perspective with Xpress-MP
From MaRDI portal
Publication:537574
Cites work
- scientific article; zbMATH DE number 2127418 (Why is no real title available?)
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- An Automatic Method of Solving Discrete Programming Problems
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Computational experience with a primal-dual interior point method for linear programming
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Hyper-sparsity in the revised simplex method and how to exploit it
- Integer Programming and Pricing
- Local branching
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- On free variables in interior point methods
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Some Lessons in Solving Practical Integer Programs
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
Cited in
(4)
This page was built for publication: Mixed integer programming: A historical perspective with Xpress-MP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537574)