On the public citation graph
The simplex SON algorithm for LP/embedded network problems
0 signed · 118 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.3800170303openalex-snapshot
Optimal multicommodity network flows with resource allocation
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.3800190106openalex-snapshot
The multicommodity network flow model revised to include vehicle per time period and node constraints
inferredcites →https://doi.org/10.1002/net.3230010304openalex-snapshot
Multicommodity networks with resource constraints: The generalized multicommodity flow 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.3230040302openalex-snapshot
Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost 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/978-94-011-7557-9openalex-snapshot
Combinatorial Programming: Methods and Applications
inferredcites →https://doi.org/10.1007/bf01442134openalex-snapshot
Solving singularly constrained generalized network problems
inferredcites →https://doi.org/10.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
inferredcites →https://doi.org/10.1007/bf01580655openalex-snapshot
The factorization approach to large-scale linear programming
inferredcites →https://doi.org/10.1007/bf01584319openalex-snapshot
The alternating basis algorithm for assignment problems
inferredcites →https://doi.org/10.1007/bf01588948openalex-snapshot
Implicit representation of generalized variable upper bounds in linear programming
inferredcites →https://doi.org/10.1007/bf01593773openalex-snapshot
Compact LP bases for a class of IP problems
inferredcites →https://doi.org/10.1007/bf02162510openalex-snapshot
Special simplex algorithm for multi-sector problems
inferredcites →https://doi.org/10.1007/bfb0120715openalex-snapshot
Implicit representation of variable upper bounds in linear programming
inferredcites →https://doi.org/10.1016/0305-0548(74)90062-8openalex-snapshot
A generalized chain labelling algorithm for solving multicommodity flow problems
inferredcites →https://doi.org/10.1016/0305-0548(75)90010-6openalex-snapshot
Past, present and future of large scale transshipment computer codes and applications
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.1976.126openalex-snapshot
Combinatorial Programming: Methods and Applications
inferredcites →https://doi.org/10.1080/03155986.1973.11731553openalex-snapshot
A Two-Stage Decomposition Algorithm For A Generalized Multi-Commodity Flow Problem
inferredcites →https://doi.org/10.1080/03155986.1979.11731713openalex-snapshot
Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
inferredcites →https://doi.org/10.1145/321724.321734openalex-snapshot
Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
inferredcites →https://doi.org/10.1287/inte.8.4.16openalex-snapshot
Improved Computer-Based Planning Techniques, Part 1
inferredcites →https://doi.org/10.1287/mnsc.1040.0269openalex-snapshot
A Suggested Computation for Maximal Multi-Commodity Network Flows
inferredcites →https://doi.org/10.1287/mnsc.23.9.994openalex-snapshot
An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
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.4.1.38openalex-snapshot
Management Models and Industrial Applications of Linear Programming
inferredcites →https://doi.org/10.1287/mnsc.5.1.97openalex-snapshot
A Suggested Computation for Maximal Multi-Commodity Network Flows
inferredcites →https://doi.org/10.1287/opre.14.1.45openalex-snapshot
Minimum-Cost Multicommodity Network Flows
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/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.21236/ada017935openalex-snapshot
Capsule View of Future Developments on Large Scale Network and Network-Related Problems
inferredcites →https://doi.org/10.2307/1907876openalex-snapshot
Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
inferredcites →https://doi.org/10.2307/2004082openalex-snapshot
Management Models and Industrial Applications of Linear Programming.
inferredcites →https://doi.org/10.6028/nbs.tn.772openalex-snapshot
A performance comparison of labeling algorithms for calculating shortest path trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200003)35:2<91::aid-net1>3.0.co;2-topenalex-snapshot
A truncated primal-infeasible dual-feasible network interior point method
inferred← citeshttps://doi.org/10.1002/1520-6750(199004)37:2<245::aid-nav3220370205>3.0.co;2-dopenalex-snapshot
Formulating processing network models: Viability theory
inferred← citeshttps://doi.org/10.1002/zamm.19970770207openalex-snapshot
Transporting and Mixing Gasses with Different Qualities
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_78openalex-snapshot
DINAS: Computer-assisted system for multi-criteria transportation and location analyses
inferred← citeshttps://doi.org/10.1007/978-1-4757-6075-0_4openalex-snapshot
Transportation-Oriented Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_66openalex-snapshot
On Optimization of the Importance Weighted OWA Aggregation of Multiple Criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-75256-1_68openalex-snapshot
On Decision Support Under Risk by the WOWA Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-13935-2_10openalex-snapshot
On Solving Optimization Problems with Ordered Average Criteria and Constraints
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-642-95406-1_3openalex-snapshot
Netgen-II: A System for Generating Structured Network-Based Mathematical Programming Test Problems
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-21637-8_14openalex-snapshot
Solving Multiobjective Distribution-Location Problems with the DINAS System
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/bf01072152openalex-snapshot
Program package for solving large-scale production and transportation planning problems (PLANNER)
inferred← citeshttps://doi.org/10.1007/bf01447654openalex-snapshot
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01582564openalex-snapshot
Dynamic factorization in large-scale optimization
inferred← citeshttps://doi.org/10.1007/bf01585656openalex-snapshot
Extracting embedded generalized networks from linear programming problems
inferred← citeshttps://doi.org/10.1007/bf01720208openalex-snapshot
A comparison of two optimization procedures for 1- and 1 1/2-dimensional cutting stock problems
inferred← citeshttps://doi.org/10.1007/bf02022105openalex-snapshot
A network-related nuclear power plant model with an intelligent branch-and-bound solution approach
inferred← citeshttps://doi.org/10.1007/bf02204863openalex-snapshot
Investments in stochastic maximum flow networks
inferred← citeshttps://doi.org/10.1007/bf02216933openalex-snapshot
A surrogate and Lagrangian approach to constrained network problems
inferred← citeshttps://doi.org/10.1007/bf02564799openalex-snapshot
Detecting embedded pure network structures in LP problems
inferred← citeshttps://doi.org/10.1007/bfb0121048openalex-snapshot
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
inferred← citeshttps://doi.org/10.1007/bfb0121099openalex-snapshot
Computational comparison of two solution procedures for allocation/processing networks
inferred← citeshttps://doi.org/10.1007/s10589-005-2057-4openalex-snapshot
On Extending the LP Computable Risk Measures to Account Downside Risk
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/0098-1354(83)80003-9openalex-snapshot
Large scale mathematical programming systems
inferred← citeshttps://doi.org/10.1016/0148-6195(83)90017-6openalex-snapshot
An operational approach to integrated working capital planning
inferred← citeshttps://doi.org/10.1016/0167-6377(83)90013-5openalex-snapshot
Basis properties and algorithmic specializations for gub transformed networks
inferred← citeshttps://doi.org/10.1016/0305-0483(95)00023-hopenalex-snapshot
Processing network models for forest management
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/0305-0548(92)90033-2openalex-snapshot
DINAS: A computer-assisted analysis system for multiobjective transshipment problems with facility location
inferred← citeshttps://doi.org/10.1016/0360-8352(90)90056-ropenalex-snapshot
Machine loading and alternate routing in a flexible manufacturing system
inferred← citeshttps://doi.org/10.1016/0360-8352(94)00036-mopenalex-snapshot
Processing network models of energy/environment systems
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90204-2openalex-snapshot
On using discrete random models within decision support systems
inferred← citeshttps://doi.org/10.1016/0377-2217(85)90091-8openalex-snapshot
Solving embedded generalized network problems
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/0377-2217(93)90321-dopenalex-snapshot
A heuristic for finding embedded network structure in mathematical programmes
inferred← citeshttps://doi.org/10.1016/b978-0-08-031829-5.50006-3openalex-snapshot
RECENT ADVANCES IN NETWORK OPTIMIZATION METHODS AND APPLICATIONS
inferred← citeshttps://doi.org/10.1016/b978-0-12-299680-1.50025-2openalex-snapshot
CREATING NETWORK STRUCTURE IN LP'S
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50009-xopenalex-snapshot
Recent Algorithms for Two Versions of Graph Realization and Remarks on Applications to Linear Programming
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/j.ijar.2009.02.010openalex-snapshot
On efficient WOWA optimization for decision support under risk
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(02)00399-5openalex-snapshot
On solving linear programs with the ordered weighted averaging objective
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.1057/jors.1980.170openalex-snapshot
The Solution of a Railway Locomotive Scheduling Problem
inferred← citeshttps://doi.org/10.1057/jors.1984.124openalex-snapshot
A Netform System for Resource Planning in the U.S. Bureau of Land Management
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2600571openalex-snapshot
Using mathematical programming heuristics in a multicriteria network flow context
inferred← citeshttps://doi.org/10.1068/a280069openalex-snapshot
The Multiple Criteria Location Problem: 2. Preference-Based Techniques and Interactive Decision Support
inferred← citeshttps://doi.org/10.1080/02331939508844084openalex-snapshot
Dual simplex algorithm with implicit representation of variable upper bounds
inferred← citeshttps://doi.org/10.1080/02522667.1992.10699091openalex-snapshot
An Implementation of Variable Upper Bounds via SUB Methodology
inferred← citeshttps://doi.org/10.1080/07408179008964154openalex-snapshot
A Primal Simplex Specialization for the Equal Flow Problem
inferred← citeshttps://doi.org/10.1109/ic3i.2014.7019677openalex-snapshot
Resolving data inconsistency in data integration
inferred← citeshttps://doi.org/10.1109/tpas.1984.318381openalex-snapshot
Efficient Large-Scale Hydro System Scheduling with Forced Spill Conditions
inferred← citeshttps://doi.org/10.1111/j.1540-5915.1996.tb00855.xopenalex-snapshot
A Multiple Objective Embedded Network Model for Human Resource Planning and an Implementation of the Tchebycheff Method
inferred← citeshttps://doi.org/10.1111/j.1752-1688.1986.tb00765.xopenalex-snapshot
NETWORK MODEL FOR DECISIONSUPPORT IN MUNICIPAL RAW WATER SUPPLY1
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/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/ijoc.8.1.55openalex-snapshot
Localizing and Diagnosing Infeasibilities in Networks
inferred← citeshttps://doi.org/10.1287/inte.28.2.32openalex-snapshot
Advances in Solving the Multicommodity-Flow Problem
inferred← citeshttps://doi.org/10.1287/mnsc.26.8.773openalex-snapshot
A Goal Programming Model for Planning Officer Accessions
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/mnsc.32.3.341openalex-snapshot
Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
inferred← citeshttps://doi.org/10.1287/mnsc.34.3.342openalex-snapshot
Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
inferred← citeshttps://doi.org/10.1287/mnsc.39.1.54openalex-snapshot
The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation
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
inferred← citeshttps://doi.org/10.26636/jtit.2009.3.933openalex-snapshot
Decision Support under Risk by Optimization of Scenario Importance Weighted OWA Aggregations
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.