On the public citation graph

Efficient dual simplex algorithms for the assignment problem

https://doi.org/10.1007/bf01582245
0 signed · 74 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.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/bf01580379openalex-snapshot
A network simplex method
inferredcites →https://doi.org/10.1007/bf01584237openalex-snapshot
A new algorithm 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/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferredcites →https://doi.org/10.1109/sfcs.1982.36openalex-snapshot
Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs
inferredcites →https://doi.org/10.1109/sfcs.1982.39openalex-snapshot
Storing a sparse table with O(1) worst case access time
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0215004openalex-snapshot
Self-Adjusting Heaps
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1287/mnsc.10.3.578openalex-snapshot
A Primal Method for the Assignment and Transportation Problems
inferredcites →https://doi.org/10.1287/opre.28.4.969openalex-snapshot
Solving the Assignment Problem by Relaxation
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.22215/etd/1981-00663openalex-snapshot
Improvements to the theoretical efficiency of the network simplex method.
inferredcites →https://doi.org/10.2307/1907816openalex-snapshot
Activity Analysis of Production and Allocation

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(199304)40:3<325::aid-nav3220400304>3.0.co;2-wopenalex-snapshot
Solving the multiperiod assignment problem with start-up costs using dual ascent
inferred← citeshttps://doi.org/10.1002/9780471703778.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/atr.5670430207openalex-snapshot
Multiple criteria optimization method for the vehicle assignment problem in a bus transportation company
inferred← citeshttps://doi.org/10.1002/net.3230210203openalex-snapshot
Maximum matchings in bipartite graphs via strong spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_60openalex-snapshot
New approximation results on graph matching and related 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-1-4757-6130-6_12openalex-snapshot
A Parallel Approximation Schema for Symmetric Linear Assignment Problem
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/bf01580579openalex-snapshot
A competitive (dual) simplex method for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf01580606openalex-snapshot
Signature classes of transportation polytopes
inferred← citeshttps://doi.org/10.1007/bf01758840openalex-snapshot
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
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/bf02278710openalex-snapshot
A shortest augmenting path algorithm for dense and sparse linear assignment problems
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/bfb0043834openalex-snapshot
Assignment problems: Recent solution methods and applications
inferred← citeshttps://doi.org/10.1007/s10479-014-1769-1openalex-snapshot
Exterior point simplex-type algorithms for linear and network optimization problems
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(86)90073-8openalex-snapshot
Improving the Hungarian assignment algorithm
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-6377(93)90045-iopenalex-snapshot
A primal-dual simplex method for linear programs
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/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.ins.2006.05.004openalex-snapshot
Incremental assignment problem
inferred← citeshttps://doi.org/10.1016/j.orl.2026.107536openalex-snapshot
A note on the low-rank assignment problem
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.1016/s0378-4754(01)00293-2openalex-snapshot
A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements
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.1080/00207160802524739openalex-snapshot
On the initialization methods of an exterior point algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1109/9.121621openalex-snapshot
A new relaxation algorithm and passive sensor data association
inferred← citeshttps://doi.org/10.1109/iccon.1989.770527openalex-snapshot
Comparison of assignment algorithms with applications to the passive sensor data association problem
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/tac.2011.2163877openalex-snapshot
Maximizing Aggregated Information in Sensor Networks Under Deadline Constraints
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/s0895480192228966openalex-snapshot
A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem
inferred← citeshttps://doi.org/10.1142/s1465876302000708openalex-snapshot
AN IMPROVED SOLUTION TO ML-BASED MULTITARGET MOTION TRACKING WITH BEARINGS-ONLY MEASUREMENTS
inferred← citeshttps://doi.org/10.1145/6462.6502openalex-snapshot
Efficient algorithms for finding maximum matching in graphs
inferred← citeshttps://doi.org/10.1287/opre.47.3.449openalex-snapshot
The Assignment Problem with Seniority and Job Priority Constraints
inferred← citeshttps://doi.org/10.1287/opre.49.5.771.10607openalex-snapshot
Inverse Optimization
inferred← citeshttps://doi.org/10.1287/trsc.1030.0073openalex-snapshot
The Dynamic Assignment Problem
inferred← citeshttps://doi.org/10.4310/cms.2015.v13.n1.a13openalex-snapshot
Optimal transport for particle image velocimetry
inferred← citeshttps://doi.org/10.53846/goediss-10213openalex-snapshot
Adaptive numerical methods for optimal and branched transport 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.