On the public citation graph

A polynomial-time test for total dual integrality in fixed dimension

https://doi.org/10.1007/bfb0121008
0 signed · 28 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.1016/0012-365x(84)90067-0openalex-snapshot
Total weak unimodularity: testing and applications
inferredcites →https://doi.org/10.1016/0024-3795(79)90018-1openalex-snapshot
Total dual integrality and integer polyhedra
inferredcites →https://doi.org/10.1016/0024-3795(81)90005-7openalex-snapshot
On total dual integrality
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/s0167-5060(08)70734-9openalex-snapshot
A Min-Max Relation for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73456-xopenalex-snapshot
Polynomial Algorithms for Totally Dual Integral Systems and Extensions
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1137/0208040openalex-snapshot
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_57openalex-snapshot
Dual Integrality in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_29openalex-snapshot
Characterizations of Total Dual Integrality
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6openalex-snapshot
Building Bridges
inferred← citeshttps://doi.org/10.1007/bf01198645openalex-snapshot
Cones in numerical modules
inferred← citeshttps://doi.org/10.1007/bf01582162openalex-snapshot
On box totally dual integral polyhedra
inferred← citeshttps://doi.org/10.1007/s10107-007-0103-yopenalex-snapshot
The complexity of recognizing linear systems with certain integrality properties
inferred← citeshttps://doi.org/10.1007/s10107-009-0294-5openalex-snapshot
Recognizing conic TDI systems is hard
inferred← citeshttps://doi.org/10.1007/s10107-010-0383-5openalex-snapshot
Alternatives for testing total dual integrality
inferred← citeshttps://doi.org/10.1007/s10107-012-0518-yopenalex-snapshot
Testing additive integrality gaps
inferred← citeshttps://doi.org/10.1007/s10479-018-2926-8openalex-snapshot
Total dual integrality of the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90084-3openalex-snapshot
Integral infeasibility and testing total dual integrality
inferred← citeshttps://doi.org/10.1016/b978-0-12-545075-1.50016-xopenalex-snapshot
References
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/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1137/1.9781611973075.98openalex-snapshot
Testing additive integrality gaps
inferred← citeshttps://doi.org/10.1287/moor.1080.0320openalex-snapshot
Parametric Integer Programming in Fixed Dimension
inferred← citeshttps://doi.org/10.5353/th_b3939198openalex-snapshot
The complexity of recognizing linear systems with certain integrality properties
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.