Copertina

Strong SDP based bounds on the cutwidth of a graph

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gaar, Elisabeth, Puges, Diane, Wiegele, Angelika
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control Discrete Mathematics 90C27, 90C22
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
di: Gaar, Elisabeth, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
di: Brosch, Daniel, et al.
Pubblicazione: (2025)

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

A more efficient reformulation of complex SDP as real SDP
di: Wang, Jie
Pubblicazione: (2023)

Getting to the Root of the Problem: Sums of Squares for Limits of Trees
di: Brosch, Daniel, et al.
Pubblicazione: (2024)

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

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

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

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

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
di: Anstreicher, Kurt M., et al.
Pubblicazione: (2025)

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

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

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

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

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
di: Hou, Di, et al.
Pubblicazione: (2025)

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

Computational complexity of sum-of-squares bounds for copositive programs
di: Palomba, Marilena, et al.
Pubblicazione: (2025)

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

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

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

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
di: Yildirim, E. Alper
Pubblicazione: (2025)

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

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

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

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