Mixed integer programming: A historical perspective with Xpress-MP (Q537574): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-006-0092-x
@@ Property / DOI: 10.1007/s10479-006-0092-x / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-006-0092-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2005207427
@@ Property / OpenAlex ID: W2005207427 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q61013131
@@ Property / Wikidata QID: Q61013131 / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
+Normal rank
@@ Property / cites work @@
+Some Lessons in Solving Practical Integer Programs
+Normal rank
@@ Property / cites work @@
+Analysis of mathematical programming problems prior to applying the simplex algorithm
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+Practical Solution of Large Mixed Integer Programming Problems with Umpire
+Normal rank
@@ Property / cites work @@
+Updated triangular factors of the basis to maintain sparsity in the product form simplex method
+Normal rank
@@ Property / cites work @@
+General purpose heuristics for integer programming. I
+Normal rank
@@ Property / cites work @@
+General purpose heuristics for integer programming. II
+Normal rank
@@ Property / cites work @@
+Integer Programming and Pricing
@@ Property / cites work: Integer Programming and Pricing / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
+Normal rank
@@ Property / cites work @@
+Hyper-sparsity in the revised simplex method and how to exploit it
+Normal rank
@@ Property / cites work @@
+Q3157361
@@ Property / cites work: Q3157361 / rank @@
+Normal rank
@@ Property / cites work @@
+An Automatic Method of Solving Discrete Programming Problems
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+On free variables in interior point methods
@@ Property / cites work: On free variables in interior point methods / rank @@
+Normal rank
@@ Property / cites work @@
+A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
+Normal rank
@@ Property / cites work @@
+Solving Mixed Integer Programming Problems Using Automatic Reformulation
+Normal rank
@@ Property / cites work @@
+Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
+Normal rank
@@ Property / cites work @@
+Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
+Normal rank
@@ Property / DOI @@
+.1007/S10479-006-0092-X
@@ Property / DOI: 10.1007/S10479-006-0092-X / rank @@
+Normal rank