Pages that link to "Item:Q3955153"

The following pages link to A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153):

Displaying 47 items.

• Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
• New crash procedures for large systems of linear constraints (Q584077) (← links)
• The double pivot simplex method (Q684156) (← links)
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
• Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
• Approximating polyhedra with sparse inequalities (Q896289) (← links)
• An efficient approach to updating simplex multipliers in the simplex algorithm (Q927163) (← links)
• A sparse counterpart of Reichel and Gragg's package QRUP (Q1044853) (← links)
• Solving embedded generalized network problems (Q1058978) (← links)
• On the integer properties of scheduling set partitioning models (Q1100095) (← links)
• An experimental investigation of enumerative methods for the linear complementarity problem (Q1104872) (← links)
• The simplex method is not always well behaved (Q1109528) (← links)
• Limit analysis in plasticity as a mathematical programming problem (Q1145533) (← links)
• A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
• A sequential LCP method for bilevel linear programming (Q1184523) (← links)
• The projection method of optimization applied to engineering plasticity problems (Q1250796) (← links)
• A fast LU update for linear programming (Q1309856) (← links)
• MOPS -- Mathematical optimization system (Q1317161) (← links)
• Sensitivity method for basis inverse representation in multistage stochastic linear programming problems (Q1321212) (← links)
• Partitioning mathematical programs for parallel solution (Q1380936) (← links)
• Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
• Optimal solutions for the cutting stock problem (Q1825768) (← links)
• An efficient algorithm for sparse null space basis problem using ABS methods (Q1944750) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
• Sparse PSD approximation of the PSD cone (Q2118107) (← links)
• Novel update techniques for the revised simplex method (Q2352418) (← links)
• A pathsearch damped Newton method for computing general equilibria (Q2365112) (← links)
• A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
• Upper bound limit analysis using discontinuous velocity fields (Q2564590) (← links)
• A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems (Q2638951) (← links)
• Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos (Q3621498) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• The Null Space Problem II. Algorithms (Q3783422) (← links)
• A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
• A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
• A practicable steepest-edge simplex algorithm (Q3887219) (← links)
• Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
• (Q3978055) (← links)
• Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
• Stable algorithm for updating dense<i>LU</i>factorization after row or column exchange and row and column addition or deletion (Q4327873) (← links)
• Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
• Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
• Permutations in the Factorization of Simplex Bases (Q5139619) (← links)
• Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
• A survey of direct methods for sparse linear systems (Q5740079) (← links)