Imagen de Portada

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gaar, Elisabeth, Pucher, Dunja
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Discrete Mathematics 90C27, 90C22
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
por: Gaar, Elisabeth
Publicado: (2020)

Strong SDP based bounds on the cutwidth of a graph
por: Gaar, Elisabeth, et al.
Publicado: (2023)

Practical Experience with Stable Set and Coloring Relaxations
por: Pucher, Dunja, et al.
Publicado: (2024)

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

Exact solution approaches for the discrete $α$-neighbor $p$-center problem
por: Gaar, Elisabeth, et al.
Publicado: (2022)

Investigating mixed-integer programming approaches for the $p$-$α$-closest-center problem
por: Gaar, Elisabeth, et al.
Publicado: (2026)

On the redundancy of transitivity constraints in the clique partitioning problem
por: Sukegawa, Noriyoshi
Publicado: (2026)

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

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
por: Kim, Junyoung, et al.
Publicado: (2024)

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
por: Masing, Berenike, et al.
Publicado: (2024)

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
por: Bui, Quang Minh, et al.
Publicado: (2024)

On exactness of SDP relaxation for the maximum cut problem
por: Bhardwaj, Avinash, et al.
Publicado: (2025)

Quantum computing and the stable set problem
por: Krpan, Aljaž, et al.
Publicado: (2024)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
por: Sinjorgo, Lennart, et al.
Publicado: (2025)

Edge expansion of a graph: SDP-based computational strategies
por: Gupte, Akshay, et al.
Publicado: (2024)

Extending the definition of set tolerances
por: Jäger, Gerold, et al.
Publicado: (2024)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
por: Barkel, Mathijs, et al.
Publicado: (2026)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
por: Del Pia, Alberto
Publicado: (2023)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
por: Tanınmış, Kübra, et al.
Publicado: (2023)

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results
por: Pozo, Miguel A., et al.
Publicado: (2022)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
por: Xu, Mingming, et al.
Publicado: (2026)

Graph burning: an overview of mathematical programs
por: Cajica-Maceda, Lourdes Beatriz, et al.
Publicado: (2025)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
por: Im, Haesol, et al.
Publicado: (2024)

Competing for the most profitable tour: The orienteering interdiction game
por: Álvarez-Miranda, Eduardo, et al.
Publicado: (2024)

Heuristic algorithms for the stochastic critical node detection problem
por: Bayarsaikhan, Tuguldur, et al.
Publicado: (2025)

Large independent sets in recursive Markov random graphs
por: Gupte, Akshay, et al.
Publicado: (2022)

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

Implied Integrality in Mixed-Integer Optimization
por: van der Hulst, Rolf, et al.
Publicado: (2025)

A semidefinite programming hierarchy for covering problems in discrete geometry
por: Riener, Cordian, et al.
Publicado: (2023)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
por: Slot, Lucas
Publicado: (2021)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
por: Jung, Woosuk L., et al.
Publicado: (2023)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
por: Halaseh, Sami, et al.
Publicado: (2026)

On generators of $k$-PSD closures of the positive semidefinite cone
por: Bhardwaj, Avinash, et al.
Publicado: (2024)

Adaptive Improvements of Multi-Objective Branch and Bound
por: Bauß, Julius, et al.
Publicado: (2023)

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$-Subgraph Problem
por: Bihani, Omkar, et al.
Publicado: (2025)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
por: Slot, Lucas, et al.
Publicado: (2024)

Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea
por: Mucke, Tom, et al.
Publicado: (2024)

Semidefinite approximations for bicliques and biindependent pairs
por: Laurent, Monique, et al.
Publicado: (2023)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
por: Gomez, Andres, et al.
Publicado: (2024)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
por: Tanaka, Masato, et al.
Publicado: (2021)