:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Au, Yu Hin, Lindzey, Nathan, Tunçel, Levent
Format:	Preprint
Published:	2020
Subjects:	Combinatorics Discrete Mathematics Optimization and Control
Online Access:	https://arxiv.org/abs/2008.08628
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2024)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2025)

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

Normalizations of factorizations over convex cones and their effects on extension complexity
by: Brown, Adam, et al.
Published: (2025)

An Eventown Result for Permutations
by: Lindzey, Nathan
Published: (2026)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
by: Proença, Nathan Benedetto, et al.
Published: (2024)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
by: Proença, Nathan Benedetto, et al.
Published: (2023)

Bond Polytope under Vertex- and Edge-sums
by: Kolman, Petr, et al.
Published: (2026)

Sparse Approximation in Lattices and Semigroups
by: Kuhlmann, Stefan, et al.
Published: (2024)

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

Valid Cuts for the Design of Potential-based Flow Networks
by: Börner, Pascal, et al.
Published: (2025)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
by: Madarasi, Péter
Published: (2026)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
by: Marić, Nevena
Published: (2025)

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

Conformally rigid graphs
by: Steinerberger, Stefan, et al.
Published: (2024)

Diffusion-Robust Optimization over Graphs
by: Aolaritei, Liviu, et al.
Published: (2026)

Approximate Graph Colouring and the Crystal with a Hollow Shadow
by: Ciardo, Lorenzo, et al.
Published: (2022)

Relaxation strength for multilinear optimization: McCormick strikes back
by: Schutte, Emily, et al.
Published: (2023)

Cluster Assignment in Multi-Agent Systems
by: Sharf, Miel, et al.
Published: (2022)

Vertex-ordering and arc-partitioning problems
by: Borsik, Nóra A., et al.
Published: (2025)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
by: Fujiwara, Hiroshi, et al.
Published: (2025)

Integer programs with bounded subdeterminants and two nonzeros per row
by: Fiorini, Samuel, et al.
Published: (2021)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
by: Wessel, Sten, et al.
Published: (2025)

Separable convex optimization over indegree polytopes
by: Borsik, Nóra A., et al.
Published: (2025)

Prefix-bounded matrices
by: Borsik, Nóra A., et al.
Published: (2025)

On the Congruency-Constrained Matroid Base
by: Liu, Siyue, et al.
Published: (2023)

Complexity of polytope diameters via perfect matchings
by: Nöbel, Christian, et al.
Published: (2024)

Integer programs with nearly totally unimodular matrices: the cographic case
by: Aprile, Manuel, et al.
Published: (2024)

Hierarchical threshold structure in Max-Cut with geometric edge weights
by: Marić, Nevena
Published: (2026)

Totally $Δ$-modular IPs with two non-zeros in most rows
by: Kober, Stefan
Published: (2024)

Total Matching and Subdeterminants
by: Ferrarini, Luca, et al.
Published: (2023)

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

On complete classes of valuated matroids
by: Husić, Edin, et al.
Published: (2021)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
by: Cornect, Anders, et al.
Published: (2024)

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

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

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

Projection-width as a structural parameter for discrete separable optimization
by: Del Pia, Alberto
Published: (2025)