On the public citation graph
A competitive (dual) simplex method for the assignment problem
0 signed · 94 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/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/bf01584319openalex-snapshot
The alternating basis algorithm for assignment problems
inferredcites →https://doi.org/10.1007/bfb0121004openalex-snapshot
Faces of dual transportation polyhedra
inferredcites →https://doi.org/10.1007/bfb0121050openalex-snapshot
On the simplex algorithm for networks and generalized networks
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1287/moor.4.2.196openalex-snapshot
Theoretical Properties of the Network Simplex Method
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.31.3.595openalex-snapshot
Technical Note—A Polynomial Simplex Method for the Assignment Problem
inferredcites →https://doi.org/10.1287/opre.33.3.527openalex-snapshot
Signature Methods for the Assignment Problem
inferredcites →https://doi.org/10.22215/etd/1981-00663openalex-snapshot
Improvements to the theoretical efficiency of the network simplex method.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199208)39:5<599::aid-nav3220390502>3.0.co;2-#openalex-snapshot
Isotonic median regression for orders representable by rooted trees
inferred← citeshttps://doi.org/10.1002/fld.264openalex-snapshot
The Monge–Kantorovitch mass transfer and its computational fluid mechanics formulation
inferred← citeshttps://doi.org/10.1002/net.3230210203openalex-snapshot
Maximum matchings in bipartite graphs via strong spanning trees
inferred← citeshttps://doi.org/10.1007/978-1-4612-0439-8_12openalex-snapshot
The Auction Algorithm for Assignment and Other Network Flow Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_6openalex-snapshot
Parallel Algorithms for Network Problems
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-015-8330-5_2openalex-snapshot
On the Complexity of the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-981-97-7150-9_23openalex-snapshot
Assignment of Resources to Aircraft Maintenance Using Pentagon and Generalized Fuzzy Models
inferred← citeshttps://doi.org/10.1007/bf00940516openalex-snapshot
AnO(n 2) active set method for solving a certain parametric quadratic program
inferred← citeshttps://doi.org/10.1007/bf01300862openalex-snapshot
The singly constrained assignment problem: An AP basis algorithm
inferred← citeshttps://doi.org/10.1007/bf01580606openalex-snapshot
Signature classes of transportation polytopes
inferred← citeshttps://doi.org/10.1007/bf01580873openalex-snapshot
Active set algorithms for isotonic regression; A unifying framework
inferred← citeshttps://doi.org/10.1007/bf01586925openalex-snapshot
An infeasible (exterior point) simplex algorithm for assignment problems
inferred← citeshttps://doi.org/10.1007/bf02096263openalex-snapshot
Degeneracy in integer linear optimization problems: A selected bibliography
inferred← citeshttps://doi.org/10.1007/bf02186476openalex-snapshot
The auction algorithm: A distributed relaxation method for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf02216923openalex-snapshot
The auction algorithm for the transportation problem
inferred← citeshttps://doi.org/10.1007/bf02288323openalex-snapshot
Algorithms and codes for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf02591692openalex-snapshot
Transportation problems which can be solved by the use of hirsch-paths for the dual problems
inferred← citeshttps://doi.org/10.1007/bf02614366openalex-snapshot
A new strongly polynomial dual network simplex algorithm
inferred← citeshttps://doi.org/10.1007/s002110050002openalex-snapshot
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
inferred← citeshttps://doi.org/10.1007/s12206-025-0405-0openalex-snapshot
Traction optimization of locomotive startup considering axle load transfer
inferred← citeshttps://doi.org/10.1007/s13198-019-00941-3openalex-snapshot
Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set
inferred← citeshttps://doi.org/10.1016/0045-7825(89)90033-9openalex-snapshot
A combinatorial algorithm for the euler equations of incompressible flows
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90054-ropenalex-snapshot
A genuinely polynomial primal simplex algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00122-topenalex-snapshot
Strongly polynomial simplex algorithm for bipartite vertex packing
inferred← citeshttps://doi.org/10.1016/0167-6377(88)90082-xopenalex-snapshot
A sequential dual simplex algorithm for the linear assignment problem
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90012-6openalex-snapshot
A sequential dual simplex algorithm for the linear assignment problem
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-6377(92)90103-aopenalex-snapshot
Solving linear bottleneck assignment problems via strong spanning trees
inferred← citeshttps://doi.org/10.1016/0167-9473(89)90001-7openalex-snapshot
Bounded isotonic median regression
inferred← citeshttps://doi.org/10.1016/0305-0548(92)90085-jopenalex-snapshot
Personnel placement in a fuzzy environment
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/0377-2217(94)00151-2openalex-snapshot
On solving a variation of the assignment problem
inferred← citeshttps://doi.org/10.1016/j.apm.2006.08.018openalex-snapshot
An extended assignment problem considering multiple inputs and outputs
inferred← citeshttps://doi.org/10.1016/j.cor.2011.09.011openalex-snapshot
Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
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.1016/s0166-218x(99)00172-9openalex-snapshot
Algorithms and codes for dense assignment problems: the state of the art
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80062-6openalex-snapshot
Parallel synchronous and asynchronous implementations of the auction algorithm
inferred← citeshttps://doi.org/10.1016/s0305-0548(97)00019-1openalex-snapshot
A new algorithm for the assignment problem: An alternative to the Hungarian method
inferred← citeshttps://doi.org/10.1017/s0962492906400015openalex-snapshot
Adaptivity with moving grids
inferred← citeshttps://doi.org/10.1038/417260aopenalex-snapshot
A reconstruction of the initial conditions of the Universe by optimal mass transportation
inferred← citeshttps://doi.org/10.1046/j.1365-2966.2003.07106.xopenalex-snapshot
Reconstruction of the early Universe as a convex optimization problem
inferred← citeshttps://doi.org/10.1051/m2an/2015034openalex-snapshot
Connections between optimal transport, combinatorial optimization and hydrodynamics
inferred← citeshttps://doi.org/10.1051/m2an/2015034/pdfopenalex-snapshot
Connections between optimal transport, combinatorial optimization and hydrodynamics
inferred← citeshttps://doi.org/10.1051/m2an:2003058openalex-snapshot
Numerical resolution of an “unbalanced” mass transport problem
inferred← citeshttps://doi.org/10.1051/proc:2008032openalex-snapshot
Solving the Uniform Density Constraint in a Stochastic Downscaling Model
inferred← citeshttps://doi.org/10.1051/ro/1988220302691openalex-snapshot
A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
inferred← citeshttps://doi.org/10.1051/ro/1991250404031openalex-snapshot
A dual feasible forest algorithm for the linear assignment problem
inferred← citeshttps://doi.org/10.1051/ro/1996300100011openalex-snapshot
A non improving simplex algorithm for transportation problems
inferred← citeshttps://doi.org/10.1057/jors.2011.14openalex-snapshot
An alternative formulation for the fuzzy assignment problem
inferred← citeshttps://doi.org/10.1080/00207160802524739openalex-snapshot
On the initialization methods of an exterior point algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1080/07408178808966195openalex-snapshot
A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine
inferred← citeshttps://doi.org/10.1093/jcde/qwae034openalex-snapshot
Virtual-Trim: A parametric geometric modeling method for heterogeneous strut-based lattice structures
inferred← citeshttps://doi.org/10.1109/iske.2010.5680794openalex-snapshot
An artificial variable RZ decision method for geometric superfluity of condition constraint in linear programming problem
inferred← citeshttps://doi.org/10.1109/tase.2024.3490620openalex-snapshot
Lexicographic Optimization-Based Priority Ascending Strategy for Feasibility Judgment and Soft Constraint Adjustment
inferred← citeshttps://doi.org/10.1111/j.1540-5915.1988.tb00269.xopenalex-snapshot
MULTIDIMENSIONAL ASSIGNMENT PROBLEMS
inferred← citeshttps://doi.org/10.1137/0403014openalex-snapshot
Advantageous Properties of Dual Transhipment Polyhedra
inferred← citeshttps://doi.org/10.1137/0732082openalex-snapshot
A Domain Decomposition Method for the Polar Factorization of Vector-Valued Mappings
inferred← citeshttps://doi.org/10.1137/s0036139995294111openalex-snapshot
Weak Existence for the Semigeostrophic Equations Formulated as a Coupled Monge--Ampère/Transport Problem
inferred← citeshttps://doi.org/10.1137/s0895480192228966openalex-snapshot
A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem
inferred← citeshttps://doi.org/10.1145/115234.115349openalex-snapshot
A parallel shortest augmenting path algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1145/2049673.2049677openalex-snapshot
Design, implementation, and analysis of maximum transversal algorithms
inferred← citeshttps://doi.org/10.1155/s1173912698000042openalex-snapshot
Managing cost uncertainties in transportation and assignment problems
inferred← citeshttps://doi.org/10.11591/eei.v12i2.4855openalex-snapshot
Solving the trapezoidal fuzzy assignment problem using the novel Dhouib-Matrix-AP1 heuristic
inferred← citeshttps://doi.org/10.1287/inte.20.4.133openalex-snapshot
The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial
inferred← citeshttps://doi.org/10.1287/moor.14.2.303openalex-snapshot
Isotonic Median Regression: A Linear Programming Approach
inferred← citeshttps://doi.org/10.1287/trsc.1030.0073openalex-snapshot
The Dynamic Assignment Problem
inferred← citeshttps://doi.org/10.12988/ams.2013.34228openalex-snapshot
Fuzzy assignment problem with generalized fuzzy numbers
inferred← citeshttps://doi.org/10.13140/rg.2.1.3853.1683openalex-snapshot
A Smart Assignment Technique with Consideration of Multicriteria Reciprocal Judgments
inferred← citeshttps://doi.org/10.1504/ijor.2026.154525openalex-snapshot
Distinctive representations of icosagonal fuzzy numbers along with novel defuzzification techniques for solving fuzzy assignment problems
inferred← citeshttps://doi.org/10.1515/9783110628616-008openalex-snapshot
8 Method for solving intuitionistic fuzzy assignment problem
inferred← citeshttps://doi.org/10.24200/j65.2018.5610openalex-snapshot
ترکیب مدل تخصیص خطی کلاسیک با برنامهریزی خطی چند هدفه برای ارزیابی رتبهبندی گزینهها
inferred← citeshttps://doi.org/10.3390/math11092084openalex-snapshot
Parallel Selector for Feature Reduction
inferred← citeshttps://doi.org/10.3390/s21041260openalex-snapshot
Energy-Efficient Swarming Flight Formation Transitions Using the Improved Fair Hungarian Algorithm
inferred← citeshttps://doi.org/10.4018/978-1-5225-8458-2.ch009openalex-snapshot
The PSK Method for Solving Fully Intuitionistic Fuzzy Assignment Problems With Some Software Tools
inferred← citeshttps://doi.org/10.4018/ijoris.2016040103openalex-snapshot
A Simple Method for Solving Fully Intuitionistic Fuzzy Real Life Assignment Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2111.08269openalex-snapshot
Data-Driven Inpatient Bed Assignment Using the P Model
inferred← citeshttps://doi.org/10.5958/2394-9309.2021.00030.5openalex-snapshot
Allocation of subjects in an educational institution by robust ranking method
inferred← citeshttps://doi.org/10.68381/jca17059openalex-snapshot
Hidden Convexity in some Nonlinear PDEs from Geomety and Physics
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.