On the public citation graph
Dynamic factorization in large-scale optimization
0 signed · 77 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.1002/nav.3800120102openalex-snapshot
A complete constructive algorithm for the general mixed linear programming problem
inferredcites →https://doi.org/10.1002/nav.3800170402openalex-snapshot
A generalized upper bounding method for doubly coupled linear programs
inferredcites →https://doi.org/10.1002/nav.3800240210openalex-snapshot
Solving multicommodity transportation problems using a primal partitioning simplex technique
inferredcites →https://doi.org/10.1002/nav.3800250410openalex-snapshot
A streamlined simplex approach to the singly constrained transportation problem
inferredcites →https://doi.org/10.1002/net.3230010404openalex-snapshot
A generalized upper bounding algorithm for multicommodity network flow problems
inferredcites →https://doi.org/10.1002/net.3230070105openalex-snapshot
A primal algorithm for solving a capacitated network flow problem with additional linear constraints
inferredcites →https://doi.org/10.1002/net.3230070403openalex-snapshot
A product form representation of the inverse of a multicommodity cycle matrix
inferredcites →https://doi.org/10.1002/net.3230080107openalex-snapshot
Multicommodity network flows—A survey
inferredcites →https://doi.org/10.1007/978-1-4419-6810-4_4openalex-snapshot
Multicommodity Distribution System Design by Benders Decomposition * † ‡
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_6openalex-snapshot
The Partitioned Preassigned Pivot Procedure (P4)
inferredcites →https://doi.org/10.1007/bf01386073openalex-snapshot
Primal partition programming for block diagonal matrices
inferredcites →https://doi.org/10.1007/bf01386316openalex-snapshot
Partitioning procedures for solving mixed-variables programming problems
inferredcites →https://doi.org/10.1007/bf01442134openalex-snapshot
Solving singularly constrained generalized network problems
inferredcites →https://doi.org/10.1007/bf01580428openalex-snapshot
Analysis of mathematical programming problems prior to applying the simplex algorithm
inferredcites →https://doi.org/10.1007/bf01580655openalex-snapshot
The factorization approach to large-scale linear programming
inferredcites →https://doi.org/10.1007/bf01584086openalex-snapshot
Reinversion with the preassigned pivot procedure
inferredcites →https://doi.org/10.1007/bf01584231openalex-snapshot
Identification of special structure constraints in linear programs
inferredcites →https://doi.org/10.1007/bf01585520openalex-snapshot
Determining GUB sets via an invert agenda algorithm
inferredcites →https://doi.org/10.1007/bf01585656openalex-snapshot
Extracting embedded generalized networks from linear programming problems
inferredcites →https://doi.org/10.1007/bf01588296openalex-snapshot
A bump triangular dynamic factorization algorithm for the simplex method
inferredcites →https://doi.org/10.1007/bf01588948openalex-snapshot
Implicit representation of generalized variable upper bounds in linear programming
inferredcites →https://doi.org/10.1007/bf02591728openalex-snapshot
Automatic identification of embedded network rows in large-scale optimization models
inferredcites →https://doi.org/10.1007/bf02591889openalex-snapshot
Large-scale linear programming: Geometry, working bases and factorizations
inferredcites →https://doi.org/10.1007/bfb0120713openalex-snapshot
A development of the product form algorithm for the simplex method using reduced transformation vectors
inferredcites →https://doi.org/10.1007/bfb0120715openalex-snapshot
Implicit representation of variable upper bounds in linear programming
inferredcites →https://doi.org/10.1007/bfb0120942openalex-snapshot
The simplex SON algorithm for LP/embedded network problems
inferredcites →https://doi.org/10.1007/springerreference_5846openalex-snapshot
Multicommodity network flows
inferredcites →https://doi.org/10.1016/0377-2217(85)90091-8openalex-snapshot
Solving embedded generalized network problems
inferredcites →https://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.
inferredcites →https://doi.org/10.1016/b978-0-12-299680-1.50027-6openalex-snapshot
SOME COMMENTS ON HIDDEN STRUCTURE IN LINEAR PROGRAMS
inferredcites →https://doi.org/10.1016/s0022-0000(67)80015-1openalex-snapshot
Generalized upper bounding techniques
inferredcites →https://doi.org/10.1057/jors.1964.14openalex-snapshot
Recent Advances in Mathematical Programming
inferredcites →https://doi.org/10.1057/jors.1985.78openalex-snapshot
Minimal Cost Flow in Processing Networks, a Primal Approach
inferredcites →https://doi.org/10.1287/inte.17.5.55openalex-snapshot
Decision Support for Aircraft and Munitions Procurement
inferredcites →https://doi.org/10.1287/inte.21.4.39openalex-snapshot
An Optimization Model for Modernizing the Army's Helicopter Fleet
inferredcites →https://doi.org/10.1287/mnsc.20.5.822openalex-snapshot
Multicommodity Distribution System Design by Benders Decomposition
inferredcites →https://doi.org/10.1287/mnsc.24.1.1openalex-snapshot
Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
inferredcites →https://doi.org/10.1287/mnsc.24.12.1209openalex-snapshot
Generalized Networks: A Fundamental Computer-Based Planning Tool
inferredcites →https://doi.org/10.1287/mnsc.26.11.1166openalex-snapshot
Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
inferredcites →https://doi.org/10.1287/mnsc.32.12.1582openalex-snapshot
A Primal Simplex Approach to Pure Processing Networks
inferredcites →https://doi.org/10.1287/mnsc.33.3.335openalex-snapshot
Scheduling Ocean Transportation of Crude Oil
inferredcites →https://doi.org/10.1287/mnsc.34.3.342openalex-snapshot
Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
inferredcites →https://doi.org/10.1287/opre.23.1.91openalex-snapshot
Solving Constrained Transportation Problems
inferredcites →https://doi.org/10.1287/opre.26.2.209openalex-snapshot
A Survey of Linear Cost Multicommodity Network Flows
inferredcites →https://doi.org/10.1287/opre.40.3.446openalex-snapshot
Optimization of Purchase, Storage and Transmission Contracts for Natural Gas Utilities
inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot
Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.1287/trsc.12.4.277openalex-snapshot
Solving Singly Constrained Transshipment Problems
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.21236/ada214568openalex-snapshot
Dynamic Factorization in Large-Scale Optimization
inferredcites →https://doi.org/10.21236/ada455195openalex-snapshot
Finding Embedded Network Rows in Linear Programs I: Extraction Heuristics
inferredcites →https://doi.org/10.6100/ir99446openalex-snapshot
Minimal cost flow in processing networks : a primal approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_6openalex-snapshot
Dynamic Matrix Factorization Methods for Using Formulations Derived From Higher Order Lifting Techniques in the Solution of the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-30749-2_28openalex-snapshot
Innovative Approaches for Global Production Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.10.018openalex-snapshot
A specialized network simplex algorithm for the constrained maximum flow problem
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00072-3openalex-snapshot
Valid integer polytope (VIP) penalties for branch-and-bound enumeration
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00127-2openalex-snapshot
A strategic model for supply chain design with logical constraints: formulation and solution
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)80080-xopenalex-snapshot
Strategic production-distribution models: A critical review with emphasis on global supply chain models
inferred← citeshttps://doi.org/10.1023/a:1008791601215openalex-snapshot
Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms
inferred← citeshttps://doi.org/10.1023/a:1013548430005openalex-snapshot
Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure
inferred← citeshttps://doi.org/10.1023/b:anor.0000004769.36807.cfopenalex-snapshot
A General Pricing Scheme for the Simplex Method
inferred← citeshttps://doi.org/10.1080/002075400188690openalex-snapshot
Strategic, tactical and operational decisions in multi-national logistics networks: A review and discussion of modelling issues
inferred← citeshttps://doi.org/10.1287/ijoc.1030.0031openalex-snapshot
Generalized Networks: The Theory of Preprocessing and an Empirical Analysis
inferred← citeshttps://doi.org/10.1287/inte.21.4.39openalex-snapshot
An Optimization Model for Modernizing the Army's Helicopter Fleet
inferred← citeshttps://doi.org/10.1287/inte.25.1.69openalex-snapshot
Global Supply Chain Management at Digital Equipment Corporation
inferred← citeshttps://doi.org/10.1287/inte.25.2.1openalex-snapshot
Consolidating and Dispatching Truck Shipments of Mobil Heavy Petroleum Products
inferred← citeshttps://doi.org/10.1287/inte.25.5.105openalex-snapshot
Twenty Years of Strategic Distribution System Design: An Evolutionary Perspective
inferred← citeshttps://doi.org/10.1287/inte.31.6.1.9646openalex-snapshot
The Kellogg Company Optimizes Production, Inventory, and Distribution
inferred← citeshttps://doi.org/10.1287/inte.31.6.1.9654openalex-snapshot
The Daniel H. Wagner Prize for Excellence in Operations Research Practice
inferred← citeshttps://doi.org/10.1287/inte.32.3.1.44openalex-snapshot
Optimizing Plant-Line Schedules and an Application at Hidden Valley Manufacturing Company
inferred← citeshttps://doi.org/10.14279/depositonce-3291openalex-snapshot
Capacitated Network Design - Multi-Commodity Flow Formulations, Cutting Planes, and Demand Uncertainty
inferred← citeshttps://doi.org/10.70675/cb3e643cz1529z4311z8a25z7c982e6b888eopenalex-snapshot
Multi-criteria Supply Chain Network Design under uncertainty
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.