On the public citation graph

On the Circuit Diameter of Dual Transportation Polyhedra

https://doi.org/10.1137/140976868
0 signed · 39 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.1007/bf01681344openalex-snapshot
On the foundations of linear and integer linear programming I
inferredcites →https://doi.org/10.1007/bf02395040openalex-snapshot
The d-step conjecture for polyhedra of dimension d<6
inferredcites →https://doi.org/10.1007/bf02614622openalex-snapshot
Variation of cost functions in integer programming
inferredcites →https://doi.org/10.1007/s10107-009-0276-7openalex-snapshot
A polynomial oracle-time algorithm for convex integer minimization
inferredcites →https://doi.org/10.1007/s10107-011-0490-yopenalex-snapshot
n-Fold integer programming in cubic time
inferredcites →https://doi.org/10.1007/s10107-013-0638-zopenalex-snapshot
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
inferredcites →https://doi.org/10.1016/j.disopt.2006.06.006openalex-snapshot
N -fold integer programming
inferredcites →https://doi.org/10.1016/j.orl.2003.11.007openalex-snapshot
Optimality criterion for a class of nonlinear integer programs
inferredcites →https://doi.org/10.1287/moor.9.4.629openalex-snapshot
The Hirsch Conjecture for Dual Transportation Polyhedra
inferredcites →https://doi.org/10.4007/annals.2012.176.1.7openalex-snapshot
A counterexample to the Hirsch Conjecture

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_11openalex-snapshot
On Circuit Diameter Bounds via Circuit Imbalances
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_6openalex-snapshot
Inapproximability of Shortest Paths on Perfect Matching Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_16openalex-snapshot
On Circuit Diameter and Straight Line Complexity
inferred← citeshttps://doi.org/10.1007/s00454-018-9995-yopenalex-snapshot
On the Circuit Diameter Conjecture
inferred← citeshttps://doi.org/10.1007/s00454-025-00770-1openalex-snapshot
Combinatorics of Generalized Parking-Function Polytopes
inferred← citeshttps://doi.org/10.1007/s10107-015-0956-4openalex-snapshot
Quadratic diameter bounds for dual network flow polyhedra
inferred← citeshttps://doi.org/10.1007/s10107-023-02025-4openalex-snapshot
Inapproximability of shortest paths on perfect matching polytopes
inferred← citeshttps://doi.org/10.1007/s10107-024-02107-xopenalex-snapshot
On circuit diameter bounds via circuit imbalances
inferred← citeshttps://doi.org/10.1007/s10107-026-02324-6openalex-snapshot
Complexity of polytope diameters via perfect matchings
inferred← citeshttps://doi.org/10.1007/s10878-025-01313-3openalex-snapshot
On combinatorial network flows algorithms and circuit augmentation for pseudoflows
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.017openalex-snapshot
The hierarchy of circuit diameters and transportation polytopes
inferred← citeshttps://doi.org/10.1016/j.dam.2019.07.025openalex-snapshot
A polyhedral model for enumeration and optimization over the set of circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.009openalex-snapshot
On the hardness of short and sign-compatible circuit walks
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.100566openalex-snapshot
Circuit walks in integral polyhedra
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100825openalex-snapshot
Circuits in extended formulations
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100862openalex-snapshot
Circuit and Graver walks and linear and integer programming
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100910openalex-snapshot
On the circuit diameter conjecture for counterexamples to the Hirsch conjecture
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.070openalex-snapshot
The Circuit Diameter of the Klee-Walkup Polyhedron
inferred← citeshttps://doi.org/10.1016/j.orl.2020.04.004openalex-snapshot
An implementation of steepest-descent augmentation for linear programs
inferred← citeshttps://doi.org/10.1016/j.orl.2021.02.003openalex-snapshot
A note on the approximability of deepest-descent circuit steps
inferred← citeshttps://doi.org/10.1017/9781009093927.004openalex-snapshot
Circuit Imbalance Measures and Linear Programming
inferred← citeshttps://doi.org/10.1137/151002915openalex-snapshot
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
inferred← citeshttps://doi.org/10.1137/17m1152115openalex-snapshot
On the Circuit Diameter of Some Combinatorial Polytopes
inferred← citeshttps://doi.org/10.1137/20m1330658openalex-snapshot
Constructing Clustering Transformations
inferred← citeshttps://doi.org/10.1137/21m1419994openalex-snapshot
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
inferred← citeshttps://doi.org/10.1515/advgeom-2016-0020openalex-snapshot
Edges versus circuits: a hierarchy of diameters in polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.1408.4184openalex-snapshot
Quadratic diameter bounds for dual network flow polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.1411.1701openalex-snapshot
The Hierarchy of Circuit Diameters and Transportation Polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1709.09642openalex-snapshot
On the Circuit Diameter of some Combinatorial Polytopes
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.