Cover Image

Accelerated Evaluation of Ollivier-Ricci Curvature Lower Bounds: Bridging Theory and Computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kang, Wonwoo, Park, Heehyun
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Discrete Mathematics Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
by: Baeckelant, Timothy, et al.
Published: (2026)

Generating realistic patient data
by: Brandt, Tabea, et al.
Published: (2025)

Convex mixed-integer optimization with Frank-Wolfe methods
by: Hendrych, Deborah, et al.
Published: (2022)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
by: Lee, Jae Hyeok, et al.
Published: (2026)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
by: Bernardelli, Ambrogio Maria, et al.
Published: (2024)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)

Tightening the mixed integer linear formulation for the piecewise linear approximation in general dimensions
by: Ploussard, Quentin, et al.
Published: (2025)

Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
by: Wu, Yikai, et al.
Published: (2025)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
by: Schade, Jamico, et al.
Published: (2023)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
by: Vercesi, Eleonora, et al.
Published: (2025)

On Circuit Diameter Bounds via Circuit Imbalances
by: Dadush, Daniel, et al.
Published: (2021)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
by: Tellache, Nour ElHouda, et al.
Published: (2025)

Learning to Remove Cuts in Integer Linear Programming
by: Puigdemont, Pol, et al.
Published: (2024)

Neural Networks and (Virtual) Extended Formulations
by: Hertrich, Christoph, et al.
Published: (2024)

Boolean Variation and Boolean Logic BackPropagation
by: Nguyen, Van Minh
Published: (2023)

Difference of Submodular Minimization via DC Programming
by: Halabi, Marwa El, et al.
Published: (2023)

Arithmetic Circuits and Neural Networks for Regular Matroids
by: Hertrich, Christoph, et al.
Published: (2025)

Discrete scalar curvature as a weighted sum of Ollivier-Ricci curvatures
by: Hickok, Abigail, et al.
Published: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
by: Alidaee, Bahram, et al.
Published: (2024)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
by: Swamy, Rahul, et al.
Published: (2024)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

Chorded cycle facets of the clique partitioning polytope
by: Irmai, Jannik, et al.
Published: (2024)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

Revisiting some classical linearizations of the quadratic binary optimization problem
by: Punnen, Abraham P., et al.
Published: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
by: Wu, Fei, et al.
Published: (2024)

Assortment Optimization For Conference Goodies With Indifferent Attendees
by: Gutiérrez, Fernanda, et al.
Published: (2024)

The Mixed Integer Trust Region Problem
by: Del Pia, Alberto
Published: (2024)

Branch and Price for the Length-Constrained Cycle Partition Problem
by: Ghannam, Mohammed, et al.
Published: (2024)

Benders decomposition for congested partial set covering location with uncertain demand
by: Calamita, Alice, et al.
Published: (2024)

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
by: Brandstetter, Christof, et al.
Published: (2024)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
by: Fouilhoux, Pierre, et al.
Published: (2024)

Minimum Cut Representability of Stable Matching Problems
by: Faenza, Yuri, et al.
Published: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
by: Moldenhauer, Carsten, et al.
Published: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
by: Wang, Changjun, et al.
Published: (2026)

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)