On the public citation graph

Basis exchange characterizations for the simplex son algorithm for LP/embedded networks

https://doi.org/10.1007/bfb0121048
0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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/net.3230010404openalex-snapshot
A generalized upper bounding algorithm for multicommodity network flow problems
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.1007/bf01442134openalex-snapshot
Solving singularly constrained generalized network problems
inferredcites →https://doi.org/10.1007/bf01580655openalex-snapshot
The factorization approach to large-scale linear programming
inferredcites →https://doi.org/10.1007/bf02162510openalex-snapshot
Special simplex algorithm for multi-sector problems
inferredcites →https://doi.org/10.1007/bfb0120942openalex-snapshot
The simplex SON algorithm for LP/embedded network problems
inferredcites →https://doi.org/10.1016/s0022-0000(67)80015-1openalex-snapshot
Generalized upper bounding techniques
inferredcites →https://doi.org/10.1016/s0022-0000(69)80026-7openalex-snapshot
A decomposition method for structured linear and nonlinear programs
inferredcites →https://doi.org/10.1057/jors.1966.75openalex-snapshot
Solution of Special Linear Programming Problems with Additional Constraints
inferredcites →https://doi.org/10.1057/jors.1981.81openalex-snapshot
Algorithms for Network Programming
inferredcites →https://doi.org/10.1287/mnsc.4.1.38openalex-snapshot
Management Models and Industrial Applications of Linear Programming
inferredcites →https://doi.org/10.1287/opre.14.4.636openalex-snapshot
An Approach to Some Structured Linear Programming Problems
inferredcites →https://doi.org/10.1287/opre.23.1.91openalex-snapshot
Solving Constrained Transportation Problems
inferredcites →https://doi.org/10.1287/opre.28.4.995openalex-snapshot
Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
inferredcites →https://doi.org/10.1287/trsc.12.4.277openalex-snapshot
Solving Singly Constrained Transshipment Problems
inferredcites →https://doi.org/10.21236/ad0623465openalex-snapshot
AN EXTENSION OF GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING
inferredcites →https://doi.org/10.2307/1907876openalex-snapshot
Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.3230240202openalex-snapshot
A fast algorithm for bounded generalized processing networks
inferred← citeshttps://doi.org/10.1007/978-3-642-49298-3_41openalex-snapshot
Dynamic Interactive Network Analysis System
inferred← citeshttps://doi.org/10.1007/978-3-662-21637-8_13openalex-snapshot
A Generalized Reference Point Approach to Multiobjective Transshipment Problem with Facility Location
inferred← citeshttps://doi.org/10.1007/978-3-662-22160-0_25openalex-snapshot
Methodological Background of the Dynamic Interactive Network Analysis System (DINAS)
inferred← citeshttps://doi.org/10.1007/bf01582254openalex-snapshot
On large scale nonlinear Network optimization
inferred← citeshttps://doi.org/10.1007/bf02216922openalex-snapshot
A survey of dynamic network flows
inferred← citeshttps://doi.org/10.1007/s10878-021-00823-0openalex-snapshot
A novel approach to subgraph selection with multiple weights on arcs
inferred← citeshttps://doi.org/10.1016/0305-0548(88)90022-6openalex-snapshot
Network flow problems with one side constraint: A comparison of three solution methods
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90054-bopenalex-snapshot
Extending and solving a multiperiod congested network flow model
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90382-7openalex-snapshot
Modeling of building evacuation problems by network flows with side constraints
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90409-8openalex-snapshot
A solver for the multi-objective transshipment problem with facility location
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/s0305-0548(98)00001-xopenalex-snapshot
A hybrid algorithm for solving network flow problems with side constraints
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00239-9openalex-snapshot
The transportation problem with exclusionary side constraints and two branch-and-bound 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.1145/62038.62041openalex-snapshot
An improved primal simplex variant for pure processing networks
inferred← citeshttps://doi.org/10.1287/ijoc.1050.0140openalex-snapshot
Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming
inferred← citeshttps://doi.org/10.1287/mnsc.32.12.1582openalex-snapshot
A Primal Simplex Approach to Pure Processing Networks
inferred← citeshttps://doi.org/10.1287/opre.36.6.811openalex-snapshot
OR Practice—A Logistics Planning System at W. R. Grace
inferred← citeshttps://doi.org/10.1287/trsc.37.2.139.15249openalex-snapshot
Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems
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.