Mixed integer programming: A historical perspective with Xpress-MP
type: Item
instance of: scholarly article
title: Mixed integer programming: A historical perspective with Xpress-MP
zbMATH Open document ID: 1213.90008
author: Robert Ashford
published in: Annals of Operations Research
publication date: 2011-05-20T00:00:00Z
Mathematics Subject Classification ID: 90-03
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5898419
describes a project that uses: XPRESS
MaRDI profile type: Publication
full work available at URL: s10479-006-0092-x
OpenAlex ID: W2005207427
Wikidata QID: Q61013131
cites work: Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
cites work: Some Lessons in Solving Practical Integer Programs
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Local branching
cites work: Practical Solution of Large Mixed Integer Programming Problems with Umpire
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
cites work: General purpose heuristics for integer programming. I
cites work: General purpose heuristics for integer programming. II
cites work: Integer Programming and Pricing
cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
cites work: Hyper-sparsity in the revised simplex method and how to exploit it
cites work: Q3157361
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: On free variables in interior point methods
cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
DOI: 10.1007/S10479-006-0092-X
description: scientific article; zbMATH DE number 5898419