On the public citation graph

On box totally dual integral polyhedra

https://doi.org/10.1007/bf01582162
0 signed · 58 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/net.3230130405openalex-snapshot
The perfectly matchable subgraph polytope of a bipartite graph
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_13openalex-snapshot
Polyhedral Combinatorics
inferredcites →https://doi.org/10.1007/bf01580250openalex-snapshot
A generalization of max flow—min cut
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02591726openalex-snapshot
Proving total dual integrality with cross-free families—A general framework
inferredcites →https://doi.org/10.1007/bfb0121008openalex-snapshot
A polynomial-time test for total dual integrality in fixed dimension
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0024-3795(77)90003-9openalex-snapshot
An unbounded matroid intersection polyhedron
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/0095-8956(78)90008-4openalex-snapshot
Blocking, antiblocking, and pairs of matroids and polymatroids
inferredcites →https://doi.org/10.1016/0095-8956(86)90087-0openalex-snapshot
Relaxations of vertex packing
inferredcites →https://doi.org/10.1016/0097-3165(76)90077-7openalex-snapshot
The structure of sperner k-families
inferredcites →https://doi.org/10.1016/0378-4754(83)90086-1openalex-snapshot
Modern applied mathematics—optimization and operations research
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50013-1openalex-snapshot
Total Dual Integrality of Linear Inequality Systems
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50025-8openalex-snapshot
Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions
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)72943-8openalex-snapshot
Polynomial Algorithms for Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73265-1openalex-snapshot
Lattice Polyhedra II: Generalization, Constructions and Examples
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(08)x7148-8openalex-snapshot
Topics on Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0500555-0openalex-snapshot
A Bound on Solutions of Linear Integer Equalities and Inequalities
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming

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-030-53262-8_3openalex-snapshot
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/bf01589420openalex-snapshot
Directed submodularity, ditroids and directed submodular flows
inferred← citeshttps://doi.org/10.1007/s10107-020-01514-0openalex-snapshot
Box-total dual integrality, box-integrality, and equimodular matrices
inferred← citeshttps://doi.org/10.1007/s10107-021-01743-xopenalex-snapshot
Box-total dual integrality and edge-connectivity
inferred← citeshttps://doi.org/10.1007/s10107-026-02347-zopenalex-snapshot
Totally equimodular matrices: decomposition and triangulation
inferred← citeshttps://doi.org/10.1007/s13160-022-00512-3openalex-snapshot
Note on the polyhedral description of the Minkowski sum of two L-convex sets
inferred← citeshttps://doi.org/10.1007/s13160-023-00589-4openalex-snapshot
Recent progress on integrally convex functions
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/j.cosrev.2026.100928openalex-snapshot
A horizon tour of box-total dual integrality
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.001openalex-snapshot
The box-TDI system associated with 2-edge connected spanning subgraphs
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.2018.09.003openalex-snapshot
Trader multiflow and box-TDI systems in series–parallel graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100810openalex-snapshot
Hard problems on box-totally dual integral polyhedra
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.06.037openalex-snapshot
Existence of equilibria in a decentralized two-level supply chain
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.07.001openalex-snapshot
On box-perfect graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.07.006openalex-snapshot
A weak box-perfect graph theorem
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1287/moor.1070.0306openalex-snapshot
A Characterization of Box-Mengerian Matroid Ports
inferred← citeshttps://doi.org/10.1287/moor.1100.0458openalex-snapshot
A Unified Approach to Box-Mengerian Hypergraphs
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.2021.1160openalex-snapshot
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.1804.08977openalex-snapshot
Principally Box-integer Polyhedra and Equimodular Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2007.03507openalex-snapshot
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra
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.