Cover Image

Circuit and Graver Walks and Linear and Integer Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Onn, Shmuel
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Discrete Mathematics Data Structures and Algorithms Combinatorics 05A, 15A, 51M, 52A, 52B, 52C, 62H, 68Q, 68R, 68U, 68W, 90B, 90C
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Degree Sequence Optimization and Extremal Degree Enumerators
by: Onn, Shmuel
Published: (2024)

The Subspace Flatness Conjecture and Faster Integer Programming
by: Reis, Victor, et al.
Published: (2023)

From approximate to exact integer programming
by: Dadush, Daniel, et al.
Published: (2022)

A New Algorithm for Computing Integer Hulls of 2D Polyhedral Sets
by: Mukherjee, Chirantan
Published: (2025)

On Supmodular Matrices
by: Onn, Shmuel
Published: (2023)

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

Efficient Decomposition of Forman-Ricci Curvature on Vietoris-Rips Complexes and Data Applications
by: de Souza, Danillo Barros, et al.
Published: (2025)

Critical moments of slices and slabs of the cube (and other polyhedral norms)
by: Brandenburg, Marie-Charlotte, et al.
Published: (2026)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)

Robinson spaces and their representation in low-dimensional metric spaces
by: Arrepol, Francisco, et al.
Published: (2026)

Attempting the impossible: enumerating extremal submodular functions for n=6
by: Csirmaz, Elod P., et al.
Published: (2024)

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
by: Oki, Taihei, et al.
Published: (2022)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
by: Ammann, Sabrina C. L., et al.
Published: (2024)

Proof-Carrying Verification for ReLU Networks via Rational Certificates
by: Gokavarapu, Chandrasekhar
Published: (2025)

A semidefinite programming characterization of the Crawford number
by: Friedland, Shmuel, et al.
Published: (2024)

An algorithm to find maximum area polygons circumscribed about a convex polygon
by: Ausserhofer, Markus, et al.
Published: (2017)

Packing, Hitting, and Colouring Squares
by: Caoduro, Marco, et al.
Published: (2022)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
by: Ye, Yuhan, et al.
Published: (2026)

Lower bounds and integrality gaps in simplicial decomposition
by: Ellison, Matthew
Published: (2024)

General Constrained Matrix Optimization
by: Garner, Casey, et al.
Published: (2024)

Spectrally Constrained Optimization
by: Garner, Casey, et al.
Published: (2023)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

A template for gradient norm minimization
by: Florea, Mihai I.
Published: (2024)

An optimal lower bound for smooth convex functions
by: Florea, Mihai I., et al.
Published: (2024)

Adaptive first-order methods with enhanced worst-case rates
by: Florea, Mihai I.
Published: (2024)

Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
by: Ye, Yuhan
Published: (2026)

Algebraic Volume for Polytope Arise from Ehrhart Theory
by: Xin, Guoce, et al.
Published: (2023)

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms
by: Kuwaranancharoen, Kananart, et al.
Published: (2023)

Transit Functions and Clustering Systems
by: Changat, Manoj, et al.
Published: (2024)

Classification by Separating Hypersurfaces: An Entropic Approach
by: Arratia, Argimiro, et al.
Published: (2025)

Saddle Networks: Structure-Preserving Architectures for Convex-Concave Functions
by: Warin, Xavier
Published: (2026)

Cutting Some Slack for SGD with Adaptive Polyak Stepsizes
by: Gower, Robert M., et al.
Published: (2022)

MoMo: Momentum Models for Adaptive Learning Rates
by: Schaipp, Fabian, et al.
Published: (2023)

Covering Relations in the Poset of Combinatorial Neural Codes
by: Jeffs, R. Amzi, et al.
Published: (2025)

The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
by: Schlotter, Ildikó, et al.
Published: (2021)

Equality cases of the Alexandrov--Fenchel inequality are not in the polynomial hierarchy
by: Chan, Swee Hong, et al.
Published: (2023)

A sharper Ramsey theorem for constrained drawings
by: Paták, Pavel
Published: (2019)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)