On the public citation graph
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
0 signed · 215 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01584086openalex-snapshot
Reinversion with the preassigned pivot procedure
inferredcites →https://doi.org/10.1016/0016-0032(64)90390-4openalex-snapshot
Rounding errors in algebraic processes
inferredcites →https://doi.org/10.1057/jors.1964.14openalex-snapshot
Recent Advances in Mathematical Programming
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0275643-8openalex-snapshot
Some Results on Sparse Matrices
inferredcites →https://doi.org/10.1093/comjnl/12.3.232openalex-snapshot
Advanced Linear-Programming Computing Techniques
inferredcites →https://doi.org/10.1137/1008066openalex-snapshot
On the Product Form of Inverses of Sparse Matrices
inferredcites →https://doi.org/10.1145/362946.362974openalex-snapshot
The simplex method of linear programming using LU decomposition
inferredcites →https://doi.org/10.1147/rd.164.0415openalex-snapshot
Maintaining a Sparse Inverse in the Simplex Method
inferredcites →https://doi.org/10.1287/mnsc.3.3.255openalex-snapshot
The Elimination form of the Inverse and its Application to Linear Programming
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.21236/ad0673010openalex-snapshot
A NUMERICAL INVESTIGATION OF THE SIMPLEX METHOD
inferredcites →https://doi.org/10.21236/ad0717073openalex-snapshot
Maintaining a Sparse Inverse in the Simplex Method
inferredcites →https://doi.org/10.2307/2002959openalex-snapshot
Rounding Errors in Algebraic Processes
inferredcites →https://doi.org/10.2307/2005268openalex-snapshot
Large Sparse Sets of Linear Equations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0395openalex-snapshot
Implementing the Simplex Method
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0775openalex-snapshot
Simplex‐Based LP Solvers
inferred← citeshttps://doi.org/10.1002/nav.3800290115openalex-snapshot
A note on splitting the bump in an elimination factorization
inferred← citeshttps://doi.org/10.1002/nme.1620261207openalex-snapshot
A steepest edge active set algorithm for solving sparse linear programming problems
inferred← citeshttps://doi.org/10.1007/0-387-30065-1_5openalex-snapshot
On implicit-factorization constraint preconditioners
inferred← citeshttps://doi.org/10.1007/3-540-06583-0_40openalex-snapshot
Some recent developments in nonlinear programming
inferred← citeshttps://doi.org/10.1007/3-540-12914-6_3openalex-snapshot
Chapter 3 Large sparse linear programming
inferred← citeshttps://doi.org/10.1007/978-1-4613-9617-8_6openalex-snapshot
A Note on Comparing Simplex and Interior Methods for Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-05089-8_1openalex-snapshot
Direct Methods for Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-65919-0_7openalex-snapshot
Basis Inverse and Update Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_19openalex-snapshot
Progress in Academic Computational Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_10openalex-snapshot
Integer Linear Programming (ILP)
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_14openalex-snapshot
Dual Simplex Phase-l Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_16openalex-snapshot
Improved Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_17openalex-snapshot
D-Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_18openalex-snapshot
Criss-Cross Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_19openalex-snapshot
Generalizing Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_2openalex-snapshot
Geometry of the Feasible Region
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_21openalex-snapshot
Dual Deficient-Basis Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_24openalex-snapshot
Pivotal Interior-Point Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_4openalex-snapshot
Duality Principle and Dual Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_5openalex-snapshot
Implementation of the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_6openalex-snapshot
Sensitivity Analysis and Parametric LP
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_7openalex-snapshot
Variants of the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-41077-2_8openalex-snapshot
A Web-Based Decision Support System Using Basis Update on Simplex Type Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-69546-9_130openalex-snapshot
Ergebnisse einer Untersuchung über Laufzeiteffekte der Modularisierung von LP-Software
inferred← citeshttps://doi.org/10.1007/978-3-642-74862-2_43openalex-snapshot
Basis Representations in Large-Scale Linear Programming Software
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-3-642-99748-8_38openalex-snapshot
Revidierte Netzwerk-Verfahren
inferred← citeshttps://doi.org/10.1007/978-3-662-00401-2_96openalex-snapshot
Linear Programming Software — Ein Überblick über das Angebot und den Entwicklungsstand moderner LP-Systeme
inferred← citeshttps://doi.org/10.1007/978-3-662-21637-8_3openalex-snapshot
Modern Techniques for Linear Dynamic and Stochastic Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-41562-7_4openalex-snapshot
Einführung in quantitative Planungsmethoden
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_13openalex-snapshot
Computational Methods For Linear Programming
inferred← citeshttps://doi.org/10.1007/978-981-19-0147-8_4openalex-snapshot
Implementation of Simplex Method
inferred← citeshttps://doi.org/10.1007/bf00940892openalex-snapshot
Sensitivity method for basis inverse representation in multistage stochastic linear programming problems
inferred← citeshttps://doi.org/10.1007/bf01299209openalex-snapshot
On the efficacy of distributed simplex algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/bf01580221openalex-snapshot
On pricing and backward transformation in linear programming
inferred← citeshttps://doi.org/10.1007/bf01580651openalex-snapshot
Matrix factorizations in optimization of nonlinear functions subject to linear constraints
inferred← citeshttps://doi.org/10.1007/bf01581089openalex-snapshot
Steepest-edge simplex algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/bf01582119openalex-snapshot
On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
inferred← citeshttps://doi.org/10.1007/bf01583778openalex-snapshot
An implementation of the simplex method for linear programming problems with variable upper bounds
inferred← citeshttps://doi.org/10.1007/bf01583795openalex-snapshot
Solving staircase linear programs by the simplex method, 1: Inversion
inferred← citeshttps://doi.org/10.1007/bf01584343openalex-snapshot
On the Bartels—Golub decomposition for linear programming bases
inferred← citeshttps://doi.org/10.1007/bf01584344openalex-snapshot
The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
inferred← citeshttps://doi.org/10.1007/bf01585094openalex-snapshot
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
inferred← citeshttps://doi.org/10.1007/bf01588257openalex-snapshot
Updated triangular factors of the working basis in winkler's decomposition approach
inferred← citeshttps://doi.org/10.1007/bf01588296openalex-snapshot
A bump triangular dynamic factorization algorithm for the simplex method
inferred← citeshttps://doi.org/10.1007/bf01589355openalex-snapshot
An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/bf01589398openalex-snapshot
A dual approach to primal degeneracy
inferred← citeshttps://doi.org/10.1007/bf01593767openalex-snapshot
Experiments in mixed-integer linear programming using pseudo-costs
inferred← citeshttps://doi.org/10.1007/bf01593804openalex-snapshot
A practicable steepest-edge simplex algorithm
inferred← citeshttps://doi.org/10.1007/bf02022083openalex-snapshot
Advanced basis construction in linear programming
inferred← citeshttps://doi.org/10.1007/bf02022088openalex-snapshot
Modifying the forrest-Tomlin and saunders updates for linear programming problems with variable upper bounds
inferred← citeshttps://doi.org/10.1007/bf02023049openalex-snapshot
Vector processing in simplex and interior methods for linear programming
inferred← citeshttps://doi.org/10.1007/bf02025532openalex-snapshot
On the use of dense matrix techniques within sparse simplex
inferred← citeshttps://doi.org/10.1007/bf02025534openalex-snapshot
A fast LU update for linear programming
inferred← citeshttps://doi.org/10.1007/bf02186472openalex-snapshot
A parallelization of the simplex method
inferred← citeshttps://doi.org/10.1007/bf02244023openalex-snapshot
Number of operations for updating the elimination form of the basis-inverse of the revised simplex-algorithm
inferred← citeshttps://doi.org/10.1007/bf02591889openalex-snapshot
Large-scale linear programming: Geometry, working bases and factorizations
inferred← citeshttps://doi.org/10.1007/bf02591933openalex-snapshot
Stable modification of explicitLU factors for simplex updates
inferred← citeshttps://doi.org/10.1007/bf02591939openalex-snapshot
Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage
inferred← citeshttps://doi.org/10.1007/bfb0120707openalex-snapshot
The current algorithmic scope of mathematical programming systems
inferred← citeshttps://doi.org/10.1007/bfb0120713openalex-snapshot
A development of the product form algorithm for the simplex method using reduced transformation vectors
inferred← citeshttps://doi.org/10.1007/bfb0120717openalex-snapshot
An accuracy test for updating triangular factors
inferred← citeshttps://doi.org/10.1007/bfb0120918openalex-snapshot
Linear programming by an effective method using triangular matrices
inferred← citeshttps://doi.org/10.1007/s00186-017-0610-4openalex-snapshot
The double pivot simplex method
inferred← citeshttps://doi.org/10.1007/s10107-007-0099-3openalex-snapshot
An efficient approach to updating simplex multipliers in the simplex algorithm
inferred← citeshttps://doi.org/10.1007/s10479-006-0092-xopenalex-snapshot
Mixed integer programming: A historical perspective with Xpress-MP
inferred← citeshttps://doi.org/10.1007/s10589-005-4802-0openalex-snapshot
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it
inferred← citeshttps://doi.org/10.1007/s10589-013-9542-yopenalex-snapshot
Parallel distributed-memory simplex for large-scale stochastic LP problems
inferred← citeshttps://doi.org/10.1007/s10589-014-9689-1openalex-snapshot
Novel update techniques for the revised simplex method
inferred← citeshttps://doi.org/10.1007/s12532-017-0130-5openalex-snapshot
Parallelizing the dual revised simplex method
inferred← citeshttps://doi.org/10.1007/s12532-020-00188-1openalex-snapshot
A triangulation and fill-reducing initialization procedure for the simplex algorithm
inferred← citeshttps://doi.org/10.1007/s42524-026-5153-zopenalex-snapshot
An overview of mathematical programming solvers: Theory, development, and recent advances
inferred← citeshttps://doi.org/10.10078/978-3-642-28673-5openalex-snapshot
Einführung in die Mathematische Optimierung
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90186-1openalex-snapshot
Numerical behavior of LP algorithms based upon the decomposition principle
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90197-8openalex-snapshot
The simplex method is not always well behaved
inferred← citeshttps://doi.org/10.1016/0098-1354(83)80003-9openalex-snapshot
Large scale mathematical programming systems
inferred← citeshttps://doi.org/10.1016/0141-1195(84)90025-1openalex-snapshot
Solving systems of sparse linear equations
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90038-9openalex-snapshot
Optimization with staircase structure: An application to generation scheduling
inferred← citeshttps://doi.org/10.1016/0360-8352(90)90006-8openalex-snapshot
Packed data structure and supersparsity savings in a linear programming code
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90070-5openalex-snapshot
Allocating blood to hospitals from a central blood bank
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90108-5openalex-snapshot
On the use of the simplex algorithm for the absolute deviation curve fitting problem
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90046-9openalex-snapshot
A stable and sparsity exploiting LU factorization of the basis matrix in linear programming
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90024-0openalex-snapshot
A note on evaluating LP software for personal computers
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90312-3openalex-snapshot
MOPS — Mathematical optimization system
inferred← citeshttps://doi.org/10.1016/b978-0-08-031829-5.50005-1openalex-snapshot
MATHEMATICAL PROGRAMMING
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50014-3openalex-snapshot
OPTIMIZATION FOR SPARSE SYSTEMS
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50017-9openalex-snapshot
A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University.
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50018-0openalex-snapshot
USING THE STEEPEST-EDGE SIMPLEX ALGORITHM TO SOLVE SPARSE LINEAR PROGRAMS
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50008-2openalex-snapshot
QP-BASED METHODS FOR LARGE-SCALE NONLINEARLY CONSTRAINED OPTIMIZATION
inferred← citeshttps://doi.org/10.1016/b978-0-12-686150-1.50012-0openalex-snapshot
LINEAR PROGRAMMING METHODS
inferred← citeshttps://doi.org/10.1016/j.cam.2007.04.051openalex-snapshot
A sparse counterpart of Reichel and Gragg’s package QRUP
inferred← citeshttps://doi.org/10.1016/j.laa.2019.12.037openalex-snapshot
Rank revealing Gaussian elimination by the maximum volume concept
inferred← citeshttps://doi.org/10.1016/j.rcim.2025.103091openalex-snapshot
Sustainable scheduling for job shops with joint maintenance, machine speed scaling, and uncertain processing times
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00010-5openalex-snapshot
A projective simplex method for linear programming
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00100-3openalex-snapshot
Investigating the sparse simplex algorithm on a distributed memory multiprocessor
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72631-8openalex-snapshot
Chapter 14 Numerical & Biological Shape Optimization
inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00707-0openalex-snapshot
Numerical aspects in developing LP softwares, LPAKO and LPABO
inferred← citeshttps://doi.org/10.1016/s0895-7177(98)00074-0openalex-snapshot
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00323-5openalex-snapshot
A projective simplex algorithm using LU decomposition
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80208-7openalex-snapshot
Chapter 11 Mathematical programming systems
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01003-0openalex-snapshot
Chapter II Linear programming
inferred← citeshttps://doi.org/10.1016/s1570-6672(08)60066-5openalex-snapshot
Robust Optimization of Hub-and-Spoke Airline Network Design Based on Multi-Objective Genetic Algorithm
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1021946924741openalex-snapshot
Incremental Norm Estimation for Dense and Sparse Matrices
inferred← citeshttps://doi.org/10.1038/sj.jors.2600987openalex-snapshot
Linear Programming: Foundations and Extensions
inferred← citeshttps://doi.org/10.1049/piee.1979.0058openalex-snapshot
Reply: Power-system state estimation using linear programming
inferred← citeshttps://doi.org/10.1051/ro/1984180100191openalex-snapshot
Amélioration de la stabilité numérique d'algorithmes de résolution de programmes linéaires à matrices de contraintes clairsemées
inferred← citeshttps://doi.org/10.1051/ro/1985190302471openalex-snapshot
Optimisation de procédés chimiques par une méthode de gradient réduit partie I. Présentation de l'algorithme
inferred← citeshttps://doi.org/10.1057/jors.1978.77openalex-snapshot
A Partitioned Inverse in Linear Programming
inferred← citeshttps://doi.org/10.1057/jors.1985.64openalex-snapshot
The Evolution of Mathematical Programming Systems
inferred← citeshttps://doi.org/10.1057/jors.1989.96openalex-snapshot
Element Pools and Numeric Coprocessors for Linear Programming on Personal Computers
inferred← citeshttps://doi.org/10.1057/jors.1992.76openalex-snapshot
Construction of LU Factors of the Basis to Reduce Build-Up during Simplex Iterations
inferred← citeshttps://doi.org/10.1080/02331934.2011.606576openalex-snapshot
An affine-scaling pivot algorithm for linear programming
inferred← citeshttps://doi.org/10.1080/02331934.2018.1523906openalex-snapshot
Improving a primal–dual simplex-type algorithm using interior point methods
inferred← citeshttps://doi.org/10.1080/02331939208843741openalex-snapshot
Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1080/1055678021000033973openalex-snapshot
On a dual method for a specially structured linear programming problem with application to stochastic programming
inferred← citeshttps://doi.org/10.1080/1055678021000049381openalex-snapshot
LPAKO: A Simplex-based Linear Programming Program
inferred← citeshttps://doi.org/10.1109/access.2020.2980309openalex-snapshot
Accelerating Revised Simplex Method Using GPU-Based Basis Update
inferred← citeshttps://doi.org/10.1109/cdc.1972.269009openalex-snapshot
Survey of computational methods for solving large scale systems
inferred← citeshttps://doi.org/10.1109/cdc.1983.269778openalex-snapshot
A basis factorization method for multi-stage linear programming problems with an application to optimal operation of an energy plant
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738813openalex-snapshot
Real-time suboptimal model predictive control using a combination of explicit MPC and online optimization
inferred← citeshttps://doi.org/10.1109/citres.2010.5619768openalex-snapshot
Computational and economic limitations of dispatch operations in the next-generation power grid
inferred← citeshttps://doi.org/10.1109/ictai.2011.124openalex-snapshot
A Simplex-Based Scalable Linear Constraint Solver for User Interface Applications
inferred← citeshttps://doi.org/10.1109/pica.1979.720058openalex-snapshot
Review Of Linear Programming Applied To Power System Rescheduling
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1109/tac.2011.2108450openalex-snapshot
Real-Time Suboptimal Model Predictive Control Using a Combination of Explicit MPC and Online Optimization
inferred← citeshttps://doi.org/10.1109/tpas.1978.354664openalex-snapshot
Power System Security Control Calculations Using Linear Programming, Part I
inferred← citeshttps://doi.org/10.1111/j.1745-4530.1982.tb00270.xopenalex-snapshot
COST OPTIMAL DEMAND FORECASTING FOR A MULTI‐LABEL INVENTORY ENVIRONMENT
inferred← citeshttps://doi.org/10.1134/s1995423910010039openalex-snapshot
applying a reduced gradient in quadratic programming
inferred← citeshttps://doi.org/10.1134/s1995423913030038openalex-snapshot
Minimization of nonlinear functions with linear constraints
inferred← citeshttps://doi.org/10.1134/s1995423915040011openalex-snapshot
A simplex method algorithm using a double basis
inferred← citeshttps://doi.org/10.1137/0313075openalex-snapshot
An Arc Method for Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/05063427xopenalex-snapshot
Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
inferred← citeshttps://doi.org/10.1137/0610029openalex-snapshot
Updating the Triangular Factorization of a Matrix
inferred← citeshttps://doi.org/10.1137/0613016openalex-snapshot
A Block-$LU$ Update for Large-Scale Linear Programming
inferred← citeshttps://doi.org/10.1137/0905041openalex-snapshot
Sparse Matrix Methods in Optimization
inferred← citeshttps://doi.org/10.1137/16m1089630openalex-snapshot
Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
inferred← citeshttps://doi.org/10.1145/1111257.1111260openalex-snapshot
Recent and future developments in SPERRY UNIVAC's FMPS product
inferred← citeshttps://doi.org/10.1145/1629255.1629271openalex-snapshot
Nonlinear systems solver in floating-point arithmetic using LP reduction
inferred← citeshttps://doi.org/10.1145/3147.3163openalex-snapshot
Integration of a primal simplex network algorithm with a large-scale mathematical programming system
inferred← citeshttps://doi.org/10.1145/356619.356620openalex-snapshot
A Status Report on Computing Algorithms for Mathematical Programming
inferred← citeshttps://doi.org/10.1145/53580.214953openalex-snapshot
Experimental investigation of an interior search method within a simplex framework
inferred← citeshttps://doi.org/10.1147/sj.311.0011openalex-snapshot
Implementing the simplex method for the Optimization Subroutine Library
inferred← citeshttps://doi.org/10.1155/2012/482193openalex-snapshot
A Two‐Phase Support Method for Solving Linear Programs: Numerical Experiments
inferred← citeshttps://doi.org/10.11606/d.55.2009.tde-26052009-150427openalex-snapshot
Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex
inferred← citeshttps://doi.org/10.1201/9780429333439-17openalex-snapshot
Alternative Methods for Representing the Inverse of Linear Programming Basis Matrices
inferred← citeshttps://doi.org/10.1287/ijoc.12.1.45.11902openalex-snapshot
Parallelizing the Dual Simplex Method
inferred← citeshttps://doi.org/10.1287/ijoc.2018.0862openalex-snapshot
Permutations in the Factorization of Simplex Bases
inferred← citeshttps://doi.org/10.1287/mnsc.24.10.1031openalex-snapshot
A Spike Collective Dynamic Factorization Algorithm for the Simplex Method
inferred← citeshttps://doi.org/10.1287/mnsc.28.10.1106openalex-snapshot
Nonlinear Optimization by Successive Linear Programming
inferred← citeshttps://doi.org/10.1287/opre.22.3.664openalex-snapshot
Technical Note—Generalized Upper Bounds and Triangular Decomposition in the Simplex Method
inferred← citeshttps://doi.org/10.1287/opre.25.1.89openalex-snapshot
Triangular Factorization and Generalized Upper Bounding Techniques
inferred← citeshttps://doi.org/10.1287/opre.28.4.995openalex-snapshot
Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
inferred← citeshttps://doi.org/10.1371/journal.pone.0043706openalex-snapshot
Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior
inferred← citeshttps://doi.org/10.1504/ijmor.2012.048901openalex-snapshot
A review of the LU update in the simplex algorithm
inferred← citeshttps://doi.org/10.1504/ijor.2022.10050447openalex-snapshot
A Double-Pivot Degenerate-Robust Simplex Algorithm for Linear Programming
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16482openalex-snapshot
Learning To Scale Mixed-Integer Programs
inferred← citeshttps://doi.org/10.31274/rtd-180813-2806openalex-snapshot
Aspects of quadratic programming with statistical applications
inferred← citeshttps://doi.org/10.4171/dms/6/16openalex-snapshot
A brief history of linear and mixed-integer programming computation
inferred← citeshttps://doi.org/10.4236/ajor.2013.36048openalex-snapshot
A Computational Comparison of Basis Updating Schemes for the Simplex Algorithm on a CPU-GPU System
inferred← citeshttps://doi.org/10.48550/arxiv.1503.01889openalex-snapshot
Parallelizing the dual revised simplex method
inferred← citeshttps://doi.org/10.48550/arxiv.1605.04719openalex-snapshot
Optimal Tagging with Markov Chain Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.