Showing 1–20 of 35 results
/ Date/ Name
Nov 20, 2019An implementation of steepest-descent augmentation for linear programsMay 13, 2014On the circuit diameter of dual transportation polyhedraJul 15, 2013On Soft Power DiagramsFeb 1, 2024On the Hardness of Short and Sign-Compatible Circuit WalksDec 19, 2023On Combinatorial Network Flows Algorithms and Circuit Augmentation for PseudoflowsApr 10, 2019Constructing Clustering TransformationsOct 16, 2019On the Computational Complexity of Finding a Sparse Wasserstein BarycenterOct 18, 2024Evacuation Planning on Time-Expanded Networks with Integrated Wildfire InformationMar 27, 2026A Canceling Heuristic for the Directed Traveling Salesman ProblemAug 10, 2022Circuits in Extended FormulationsFeb 8, 2023On the Circuit Diameter Conjecture for Counterexamples to the Hirsch ConjectureMar 24, 2015Efficient solutions for weight-balanced partitioning problemsNov 24, 2016On the Circuit Diameter ConjectureDec 5, 2017Circuit Walks in Integral PolyhedraDec 4, 2025On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest ProblemsNov 1, 2018A Polyhedral Model for Enumeration and Optimization over the Set of CircuitsOct 25, 2022An Integer Program for Pricing Support Points of Exact BarycentersMar 17, 2022On the Combinatorial Diameters of Parallel and Series ConnectionsJul 2, 2019A Column Generation Approach to the Discrete Barycenter ProblemNov 6, 2014The Hierarchy of Circuit Diameters and Transportation Polytopes