Image de couverture de livre

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Au, Yu Hin, Lindzey, Nathan, Tunçel, Levent
Format:	Preprint
Publié:	2020
Sujets:	Combinatorics Discrete Mathematics Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2024)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2025)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
par: Proença, Nathan Benedetto, et autres
Publié: (2026)

Normalizations of factorizations over convex cones and their effects on extension complexity
par: Brown, Adam, et autres
Publié: (2025)

An Eventown Result for Permutations
par: Lindzey, Nathan
Publié: (2026)

Bond Polytope under Vertex- and Edge-sums
par: Kolman, Petr, et autres
Publié: (2026)

Sparse Approximation in Lattices and Semigroups
par: Kuhlmann, Stefan, et autres
Publié: (2024)

On Circuit Diameter Bounds via Circuit Imbalances
par: Dadush, Daniel, et autres
Publié: (2021)

Valid Cuts for the Design of Potential-based Flow Networks
par: Börner, Pascal, et autres
Publié: (2025)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
par: Proença, Nathan Benedetto, et autres
Publié: (2024)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
par: Proença, Nathan Benedetto, et autres
Publié: (2023)

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

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

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
par: Vercesi, Eleonora, et autres
Publié: (2025)

Conformally rigid graphs
par: Steinerberger, Stefan, et autres
Publié: (2024)

Diffusion-Robust Optimization over Graphs
par: Aolaritei, Liviu, et autres
Publié: (2026)

Approximate Graph Colouring and the Crystal with a Hollow Shadow
par: Ciardo, Lorenzo, et autres
Publié: (2022)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)

Relaxation strength for multilinear optimization: McCormick strikes back
par: Schutte, Emily, et autres
Publié: (2023)

Cluster Assignment in Multi-Agent Systems
par: Sharf, Miel, et autres
Publié: (2022)

Vertex-ordering and arc-partitioning problems
par: Borsik, Nóra A., et autres
Publié: (2025)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
par: Fujiwara, Hiroshi, et autres
Publié: (2025)

Integer programs with bounded subdeterminants and two nonzeros per row
par: Fiorini, Samuel, et autres
Publié: (2021)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
par: Wessel, Sten, et autres
Publié: (2025)

Separable convex optimization over indegree polytopes
par: Borsik, Nóra A., et autres
Publié: (2025)

Prefix-bounded matrices
par: Borsik, Nóra A., et autres
Publié: (2025)

On the Congruency-Constrained Matroid Base
par: Liu, Siyue, et autres
Publié: (2023)

Complexity of polytope diameters via perfect matchings
par: Nöbel, Christian, et autres
Publié: (2024)

Integer programs with nearly totally unimodular matrices: the cographic case
par: Aprile, Manuel, et autres
Publié: (2024)

Hierarchical threshold structure in Max-Cut with geometric edge weights
par: Marić, Nevena
Publié: (2026)

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

Total Matching and Subdeterminants
par: Ferrarini, Luca, et autres
Publié: (2023)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
par: Swamy, Rahul, et autres
Publié: (2024)

Projection-width as a structural parameter for discrete separable optimization
par: Del Pia, Alberto
Publié: (2025)

On complete classes of valuated matroids
par: Husić, Edin, et autres
Publié: (2021)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
par: Cornect, Anders, et autres
Publié: (2024)

Arithmetic Circuits and Neural Networks for Regular Matroids
par: Hertrich, Christoph, et autres
Publié: (2025)

Neural Networks and (Virtual) Extended Formulations
par: Hertrich, Christoph, et autres
Publié: (2024)