On the public citation graph
A primal algorithm for optimum matching
0 signed · 164 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.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/3-540-36478-1_3openalex-snapshot
Matching: A Well-Solved Class of Integer Linear Programs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-642-40179-4_2openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01584319openalex-snapshot
The alternating basis algorithm for assignment problems
inferredcites →https://doi.org/10.1007/bf01889914openalex-snapshot
On the structure of factorizable graphs
inferredcites →https://doi.org/10.1016/0095-8956(71)90027-xopenalex-snapshot
On the 1-factors of n-connected graphs
inferredcites →https://doi.org/10.1016/0095-8956(72)90002-0openalex-snapshot
Establishing the matching polytope
inferredcites →https://doi.org/10.1016/s0167-5060(08)70333-9openalex-snapshot
Local Unimodularity in the Matching Polytope
inferredcites →https://doi.org/10.1090/s0002-9904-1948-09098-xopenalex-snapshot
Distinct representatives of subsets
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.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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(199901)33:1<1::aid-net1>3.0.co;2-mopenalex-snapshot
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
inferred← citeshttps://doi.org/10.1002/nav.10093openalex-snapshot
A generalization of the weighted set covering problem
inferred← citeshttps://doi.org/10.1002/net.3230110105openalex-snapshot
Sensitivity analysis of optimal matchings
inferred← citeshttps://doi.org/10.1002/net.3230110407openalex-snapshot
A shortest augmenting path method for solving minimal perfect matching problems
inferred← citeshttps://doi.org/10.1002/net.3230120403openalex-snapshot
A 1‐matching blossom‐type algorithm for edge covering problems
inferred← citeshttps://doi.org/10.1002/net.3230130406openalex-snapshot
An analysis of alternative strategies for implementing matching algorithms
inferred← citeshttps://doi.org/10.1002/net.3230130407openalex-snapshot
Dynamic matchings and quasidynamic fractional matchings. I
inferred← citeshttps://doi.org/10.1002/net.3230130408openalex-snapshot
Dynamic matchings and quasidynamic fractional matchings. II
inferred← citeshttps://doi.org/10.1002/net.3230160102openalex-snapshot
Solving large‐scale matching problems efficiently: A new primal matching approach
inferred← citeshttps://doi.org/10.1002/net.3230200602openalex-snapshot
Matching problems with generalized upper bound side constraints
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_7openalex-snapshot
On Multi-Object Auctions and Matching Theory: Algorithmic Aspects
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_3openalex-snapshot
Matching: Arc Routing and the Solution Connection
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-030-53262-8_3openalex-snapshot
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-59250-3_35openalex-snapshot
Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_11openalex-snapshot
A TDI Description of Restricted 2-Matching Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_31openalex-snapshot
On Polyhedra Related to Even Factors
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_12openalex-snapshot
Fifty-Plus Years of Combinatorial Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_32openalex-snapshot
Optimal Matching Forests and Valuated Delta-Matroids
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_13openalex-snapshot
Polyhedral Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-68997-0_57openalex-snapshot
Optimale Zuordnungen und Matchings: Anwendungen, Grundlagen und Verfahren
inferred← citeshttps://doi.org/10.1007/978-3-642-77254-2_37openalex-snapshot
Subtour Elimination Algorithm for the Capacitated Arc Routing 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-3-662-48350-3_38openalex-snapshot
Node-Balancing by Edge-Increments
inferred← citeshttps://doi.org/10.1007/bf01293485openalex-snapshot
New primal and dual matching heuristics
inferred← citeshttps://doi.org/10.1007/bf01581023openalex-snapshot
Optimum matching forests II: General weights
inferred← citeshttps://doi.org/10.1007/bf01581198openalex-snapshot
Tight integral duality gap in the Chinese Postman problem
inferred← citeshttps://doi.org/10.1007/bf01581725openalex-snapshot
A maximumb-matching problem arising from median location models with applications to the roommates problem
inferred← citeshttps://doi.org/10.1007/bf01582238openalex-snapshot
Efficient dual simplex algorithms for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf01582245openalex-snapshot
Efficient dual simplex algorithms for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf01584376openalex-snapshot
Solving matching problems with linear programming
inferred← citeshttps://doi.org/10.1007/bf01721246openalex-snapshot
Recent trends in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bf02122558openalex-snapshot
The Schrijver system of odd join polyhedra
inferred← citeshttps://doi.org/10.1007/bf02288324openalex-snapshot
Solving non-bipartite matching problems via shortest path techniques
inferred← citeshttps://doi.org/10.1007/bf02591726openalex-snapshot
Proving total dual integrality with cross-free families—A general framework
inferred← citeshttps://doi.org/10.1007/bfb0043834openalex-snapshot
Assignment problems: Recent solution methods and applications
inferred← citeshttps://doi.org/10.1007/bfb0120895openalex-snapshot
Dual integrality in b-matching problems
inferred← citeshttps://doi.org/10.1007/bfb0121094openalex-snapshot
A short note on matching algorithms
inferred← citeshttps://doi.org/10.1007/s00453-014-9945-xopenalex-snapshot
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem
inferred← citeshttps://doi.org/10.1007/s00453-024-01287-4openalex-snapshot
Popular Roommates in Simply Exponential Time
inferred← citeshttps://doi.org/10.1007/s004930070009openalex-snapshot
Total Dual Integrality of Matching Forest Constraints
inferred← citeshttps://doi.org/10.1007/s10107-007-0154-0openalex-snapshot
A weighted even factor algorithm
inferred← citeshttps://doi.org/10.1007/s10107-008-0211-3openalex-snapshot
Weighted restricted 2-matching
inferred← citeshttps://doi.org/10.1007/s10107-010-0397-zopenalex-snapshot
A weighted independent even factor algorithm
inferred← citeshttps://doi.org/10.1007/s10107-016-1085-4openalex-snapshot
Integer round-up property for the chromatic number of some h-perfect graphs
inferred← citeshttps://doi.org/10.1007/s10107-019-01388-xopenalex-snapshot
Stochastic packing integer programs with few queries
inferred← citeshttps://doi.org/10.1007/s10107-026-02416-3openalex-snapshot
Real-weighted general factors on subcubic graphs
inferred← citeshttps://doi.org/10.1007/s101070100256openalex-snapshot
Matching, matroids, and extensions
inferred← citeshttps://doi.org/10.1007/s10514-013-9351-2openalex-snapshot
An anytime assignment algorithm: From local task swapping to global optimality
inferred← citeshttps://doi.org/10.1007/s10589-022-00406-7openalex-snapshot
Minimum cost b-matching problems with neighborhoods
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90067-0openalex-snapshot
Total weak unimodularity: testing and applications
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90150-xopenalex-snapshot
Packings by cliques and by finite families of graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90173-fopenalex-snapshot
Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems
inferred← citeshttps://doi.org/10.1016/0024-3795(79)90018-1openalex-snapshot
Total dual integrality and integer polyhedra
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00149-topenalex-snapshot
An identity for matching and skew-symmetric determinant
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90011-4openalex-snapshot
Short proofs on the matching polyhedron
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90064-xopenalex-snapshot
An integer analogue of Carathéodory's theorem
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90032-4openalex-snapshot
A min-max relation for stable sets in graphs with no odd-K4
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90013-7openalex-snapshot
A note on matchings and separability
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90017-5openalex-snapshot
Algorithms for finding K-best perfect matchings
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)00092-ropenalex-snapshot
Adjacency on combinatorial polyhedra
inferred← citeshttps://doi.org/10.1016/0167-6377(81)90021-3openalex-snapshot
Total dual integrality and b-matchings
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90048-5openalex-snapshot
On dual integrality in matching problems
inferred← citeshttps://doi.org/10.1016/0191-2615(87)90002-6openalex-snapshot
Truck backhauling on networks with many terminals
inferred← citeshttps://doi.org/10.1016/0305-0548(81)90035-6openalex-snapshot
Current and future research directions in network optimization
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50013-1openalex-snapshot
Total Dual Integrality of Linear Inequality Systems
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.054openalex-snapshot
The Schrijver system of the flow cone in series–parallel graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.01.001openalex-snapshot
Facets of the independent path-matching polytope
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.01.004openalex-snapshot
On the feedback vertex set polytope of a series–parallel graph
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.10.004openalex-snapshot
An algorithmic approach to dual integrality of matching and extensions
inferred← citeshttps://doi.org/10.1016/j.orl.2021.11.009openalex-snapshot
On the complexity of recognizing integrality and total dual integrality of the {0,1/2}-closure
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.024openalex-snapshot
A combinatoric interpretation of dual variables for weighted matching and f -factors
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.027openalex-snapshot
Bi-criteria and approximation algorithms for restricted matchings
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.034openalex-snapshot
The cyclical scheduling problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00073-9openalex-snapshot
Constrained multi-object auctions and -matching
inferred← citeshttps://doi.org/10.1016/s0166-218x(85)80004-4openalex-snapshot
Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72956-6openalex-snapshot
Independence Systems and Perfect K-Matroid-Intersections
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00484-8openalex-snapshot
A genetic-based framework for solving (multi-criteria) weighted matching problems
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80121-5openalex-snapshot
Chapter 4 The traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1017/cbo9780511977152openalex-snapshot
Iterative Methods in Combinatorial Optimization
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.1057/jors.1977.181openalex-snapshot
Mathematical Programming Studies
inferred← citeshttps://doi.org/10.1080/02331938608843121openalex-snapshot
Scaling: A General Framework
inferred← citeshttps://doi.org/10.1088/0305-4470/15/10/028openalex-snapshot
On the computational complexity of Ising spin glass models
inferred← citeshttps://doi.org/10.1109/ciss.2006.286659openalex-snapshot
Fast Matching Algorithms for Repetitive Optimization: An Application to Switch Scheduling
inferred← citeshttps://doi.org/10.1109/focs.2012.35openalex-snapshot
The Cutting Plane Method Is Polynomial for Perfect Matchings
inferred← citeshttps://doi.org/10.1109/jsac-ocn.2006.22605openalex-snapshot
An improved algorithm for optimal lightpath establishment on a tree topology
inferred← citeshttps://doi.org/10.1109/sfcs.1985.3openalex-snapshot
A scaling algorithm for weighted matching on general graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548466openalex-snapshot
The optimal path-matching problem
inferred← citeshttps://doi.org/10.1137/0212040openalex-snapshot
On the Complexity of General Graph Factor Problems
inferred← citeshttps://doi.org/10.1137/0604022openalex-snapshot
A Minimal Totally Dual Integral Defining System for the b -Matching Polyhedron
inferred← citeshttps://doi.org/10.1137/1.9781611973099.110openalex-snapshot
Efficient Algorithms for Maximum Weight Matchings in General Graphs with Small Edge Weights
inferred← citeshttps://doi.org/10.1137/110827661openalex-snapshot
Optimal Matching Forests and Valuated Delta-Matroids
inferred← citeshttps://doi.org/10.1137/18m1176737openalex-snapshot
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
inferred← citeshttps://doi.org/10.1137/s0097539791201897openalex-snapshot
Computing the Degree of Determinants via Combinatorial Relaxation
inferred← citeshttps://doi.org/10.1145/1132516.1132576openalex-snapshot
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
inferred← citeshttps://doi.org/10.1145/115234.115366openalex-snapshot
Faster scaling algorithms for general graph matching problems
inferred← citeshttps://doi.org/10.1145/2529989openalex-snapshot
Linear-Time Approximation for Maximum Weight Matching
inferred← citeshttps://doi.org/10.1145/3155301openalex-snapshot
Scaling Algorithms for Weighted Matching in General Graphs
inferred← citeshttps://doi.org/10.1145/3183369openalex-snapshot
Data Structures for Weighted Matching and Extensions to b -matching and f -factors
inferred← citeshttps://doi.org/10.1145/48014.48015openalex-snapshot
A new class of heuristic algorithms for weighted perfect matching
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.138openalex-snapshot
Computing Minimum-Weight Perfect Matchings
inferred← citeshttps://doi.org/10.1287/moor.2016.0806openalex-snapshot
New Algorithms for Maximum Weight Matching and a Decomposition Theorem
inferred← citeshttps://doi.org/10.1287/moor.2017.0852openalex-snapshot
When Is the Matching Polytope Box-Totally Dual Integral?
inferred← citeshttps://doi.org/10.1287/moor.28.1.92.14263openalex-snapshot
A Separation Algorithm for b -Matching Degree-Sequence Polyhedra
inferred← citeshttps://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferred← citeshttps://doi.org/10.15607/rss.2012.viii.033openalex-snapshot
A Distributable and Computation-flexible Assignment Algorithm: From Local Task Swapping to Global Optimality
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4461982/v1openalex-snapshot
A Strongly Polynomial-Time Algorithm forWeighted General Factors with Three Feasible Degrees*
inferred← citeshttps://doi.org/10.21236/ada215112openalex-snapshot
Faster Scaling Algorithms for General Graph Matching Problems
inferred← citeshttps://doi.org/10.21236/ada460051openalex-snapshot
Parallel Algorithms for the Assignment and Minimum-Cost Flow Problems
inferred← citeshttps://doi.org/10.2298/yjor0501147popenalex-snapshot
A parametric visualization software for the assignment problem
inferred← citeshttps://doi.org/10.33915/etd.312openalex-snapshot
On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2016.3openalex-snapshot
Streaming Verification of Graph Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4058openalex-snapshot
Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0790openalex-snapshot
Scaling algorithms for approximate and exact maximum weight matching
inferred← citeshttps://doi.org/10.48550/arxiv.1311.5481openalex-snapshot
Bi-Criteria and Approximation Algorithms for Restricted Matchings
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06919openalex-snapshot
Node-balancing by edge-increments
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02288openalex-snapshot
On 4-critical t-perfect graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.07541openalex-snapshot
Data Structures for Weighted Matching and Extensions to $b$-matching and $f$-factors
inferred← citeshttps://doi.org/10.48550/arxiv.1911.04122openalex-snapshot
Classification on the Computational Complexity of Spin Models
inferred← citeshttps://doi.org/10.5555/2615731.2615804openalex-snapshot
Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow
inferred← citeshttps://doi.org/10.5555/320176.320229openalex-snapshot
Data structures for weighted matching and nearest common ancestors with linking
inferred← citeshttps://doi.org/10.70675/72f96944zb711z4ad5z9d5bzaac3410bdf92openalex-snapshot
TDIness and Multicuts
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.