On the public citation graph
Transportation problems which can be solved by the use of hirsch-paths for the dual problems
0 signed · 44 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/net.3230010206openalex-snapshot
On some techniques useful for solution of transportation network problems
inferredcites →https://doi.org/10.1007/978-3-642-51576-7openalex-snapshot
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
inferredcites →https://doi.org/10.1007/bf01580579openalex-snapshot
A competitive (dual) simplex method for the assignment problem
inferredcites →https://doi.org/10.1007/bf01582238openalex-snapshot
Efficient dual simplex algorithms for the assignment problem
inferredcites →https://doi.org/10.1007/bf01582245openalex-snapshot
Efficient dual simplex algorithms for the assignment problem
inferredcites →https://doi.org/10.1007/bf02395040openalex-snapshot
The d-step conjecture for polyhedra of dimension d<6
inferredcites →https://doi.org/10.1007/bfb0121240openalex-snapshot
On two special classes of transportation polytopes
inferredcites →https://doi.org/10.1063/1.3060724openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.1145/367436.367476openalex-snapshot
An algorithm for the assignment problem
inferredcites →https://doi.org/10.1287/moor.12.4.718openalex-snapshot
The d-Step Conjecture and Its Relatives
inferredcites →https://doi.org/10.1287/moor.9.4.629openalex-snapshot
The Hirsch Conjecture for Dual Transportation Polyhedra
inferredcites →https://doi.org/10.1287/opre.28.4.969openalex-snapshot
Solving the Assignment Problem by Relaxation
inferredcites →https://doi.org/10.1287/opre.33.3.527openalex-snapshot
Signature Methods for the Assignment Problem
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/1402058openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.2307/2002374openalex-snapshot
An Introduction to Combinatorial Analysis
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-0-387-74759-0_94openalex-snapshot
Convex Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_2openalex-snapshot
Linear Assignment Problems and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-77489-8_5openalex-snapshot
The Linear Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_18openalex-snapshot
The Diameter of Polytopes and Related Applications
inferred← citeshttps://doi.org/10.1007/978-94-015-8330-5_2openalex-snapshot
On the Complexity of the Simplex Method
inferred← citeshttps://doi.org/10.1007/bf01580606openalex-snapshot
Signature classes of transportation polytopes
inferred← citeshttps://doi.org/10.1007/bf01585755openalex-snapshot
A strongly polynomial algorithm for the transportation problem
inferred← citeshttps://doi.org/10.1007/bf01586925openalex-snapshot
An infeasible (exterior point) simplex algorithm for assignment problems
inferred← citeshttps://doi.org/10.1007/s10107-022-01811-wopenalex-snapshot
Utility/privacy trade-off as regularized optimal transport
inferred← citeshttps://doi.org/10.1007/springerreference_72172openalex-snapshot
Convex Discrete Optimization
inferred← citeshttps://doi.org/10.1016/0031-3203(94)00162-fopenalex-snapshot
Automatic context-sensitive karyotyping of human chromosomes based on elliptically symmetric statistical distributions
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90050-fopenalex-snapshot
Sparse dual transportation polyhedra: Extreme points and signatures
inferred← citeshttps://doi.org/10.1016/0167-8655(91)90057-sopenalex-snapshot
An efficient transportation algorithm for automatic chromosome karyotyping
inferred← citeshttps://doi.org/10.1016/0167-8655(94)90104-xopenalex-snapshot
A hybrid method for automatic chromosome karyotyping
inferred← citeshttps://doi.org/10.1016/0167-9236(88)90010-3openalex-snapshot
Reflections on the architecture of a decision support system for personnel assignment scheduling in production cell technology
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90243-oopenalex-snapshot
A relaxation column signature method for assignment problems
inferred← citeshttps://doi.org/10.1016/j.csda.2009.08.023openalex-snapshot
Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.12.003openalex-snapshot
Worst case examples of an exterior point algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1051/ro/1996300100011openalex-snapshot
A non improving simplex algorithm for transportation problems
inferred← citeshttps://doi.org/10.1137/0403014openalex-snapshot
Advantageous Properties of Dual Transhipment Polyhedra
inferred← citeshttps://doi.org/10.1177/096228029200100104openalex-snapshot
Statistical methods in diagnosis
inferred← citeshttps://doi.org/10.1287/moor.12.4.718openalex-snapshot
The d-Step Conjecture and Its Relatives
inferred← citeshttps://doi.org/10.1504/ijbra.2005.007911openalex-snapshot
Fast chromosome karyotyping by auction algorithm
inferred← citeshttps://doi.org/10.3233/978-1-60750-718-5-183openalex-snapshot
Convex Discrete 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.