Mixed integer programming: A historical perspective with Xpress-MP
From MaRDI portal
Publication:537574
DOI10.1007/s10479-006-0092-xzbMath1213.90008OpenAlexW2005207427WikidataQ61013131 ScholiaQ61013131MaRDI QIDQ537574
Publication date: 20 May 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0092-x
Mixed integer programming (90C11) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items (4)
Cascading knapsack inequalities: reformulation of a crude oil distribution problem ⋮ Progress in mathematical programming solvers from 2001 to 2020 ⋮ Day-ahead market bidding for a Nordic hydropower producer: taking the Elbas market into account ⋮ Learning to sparsify travelling salesman problem instances
Uses Software
Cites Work
- Unnamed Item
- Computational experience with a primal-dual interior point method for linear programming
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Local branching
- Hyper-sparsity in the revised simplex method and how to exploit it
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Integer Programming and Pricing
- An Automatic Method of Solving Discrete Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Some Lessons in Solving Practical Integer Programs
- Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- On free variables in interior point methods
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
This page was built for publication: Mixed integer programming: A historical perspective with Xpress-MP
