Cover Image

On the Diameter of a 2-Sum of Polyhedra

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Borgwardt, Steffen, Grewe, Weston, Lee, Jon
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 52B05, 52B40, 90C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
by: Black, Alexander E., et al.
Published: (2023)

On the Hardness of Short and Sign-Compatible Circuit Walks
by: Borgwardt, Steffen, et al.
Published: (2024)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
by: Borgwardt, Steffen, et al.
Published: (2025)

On cone partitions for the min-cut and max-cut problems with non-negative edges
by: Nikolaev, Andrei V., et al.
Published: (2023)

Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
by: Black, Alexander E.
Published: (2024)

Lower bounds for cube-ideal set-systems
by: Abdi, Ahmad, et al.
Published: (2025)

Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
by: Bruckamp, Justus, et al.
Published: (2024)

Unimodality of the number of paths per length on polytopes: Examples, counter-examples, and central limit theorem
by: Juhnke, Martina, et al.
Published: (2025)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

Combinatorics of generalized parking-function polytopes
by: Bayer, Margaret M., et al.
Published: (2024)

A minimal compact description of the diversity index polytope
by: Frohn, Martin, et al.
Published: (2024)

Biobjective optimization with M-convex functions
by: Fukuda, Ellen H., et al.
Published: (2025)

The vector linear program solver Bensolve -- notes on theoretical background
by: Löhne, Andreas, et al.
Published: (2015)

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
by: Löhne, Andreas, et al.
Published: (2015)

Cuts and semidefinite liftings for the complex cut polytope
by: Sinjorgo, Lennart, et al.
Published: (2024)

On the connected blocks polytope
by: Bruckamp, Justus, et al.
Published: (2023)

Quotients of M-convex sets and M-convex functions
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024)

Root polytopes and Jaeger-type dissections for directed graphs
by: Kálmán, Tamás, et al.
Published: (2021)

The geometry of zonotopal algebras I: cohomology of graphical configuration spaces
by: Crowley, Colin, et al.
Published: (2025)

On 1-skeleton of the cut polytopes
by: Nikolaev, Andrei V.
Published: (2024)

From linear programming to colliding particles
by: Black, Alexander E., et al.
Published: (2024)

Deformed Intersections of Half-spaces
by: Fu, Houshan, et al.
Published: (2024)

No-three-in-line sets on the checkerboard grid
by: Prellberg, Thomas
Published: (2026)

A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
by: Tóthmérész, Lilla
Published: (2022)

The Geometry and Well-Posedness of Sparse Regularized Linear Regression
by: Everink, Jasper Marijn, et al.
Published: (2024)

Face enumeration for split matroid polytopes
by: Ferroni, Luis, et al.
Published: (2023)

The $cd$-index of base polytopes for connected split matroids
by: Faustini, Tommaso, et al.
Published: (2025)

Generation of $3$-connected, planar line graphs
by: Hollowbread-Smith, Phoebe, et al.
Published: (2024)

The Boolean polynomial polytope with multiple choice constraints
by: Shao, Sihong, et al.
Published: (2024)

Acyclotopes and Tocyclotopes
by: Bach, Eleonore, et al.
Published: (2024)

Unbounded matroids
by: Berggren, Jonah, et al.
Published: (2023)

Determining inscribability of polytopes via rank minimization based on slack matrices
by: Chen, Yiwen, et al.
Published: (2025)

Unimodular polytopes and column number bounds on polytopal totally unimodular matrices via Seymour's decomposition theorem
by: Nill, Benjamin
Published: (2024)

Matroids, intersecting bases, and Borsuk property
by: López-Campos, Gyivan, et al.
Published: (2025)

The Best Ways to Slice a Polytope
by: Brandenburg, Marie-Charlotte, et al.
Published: (2023)

The density of planar sets avoiding unit distances
by: Ambrus, Gergely, et al.
Published: (2022)

The Ehrhart polynomial of a matroid specializes to the beta invariant
by: Chavez, Anastasia, et al.
Published: (2025)

Counting plane arrangements via oriented matroids
by: Forcey, Stefan
Published: (2025)

Sharp Threshold for Cliques in Random 0/1 Polytope Graphs
by: Babecki, Catherine, et al.
Published: (2025)

Subdivisions of Hypersimplices: with a View Toward Finite Metric Spaces
by: Casabella, Laura, et al.
Published: (2024)