Image de couverture de livre

Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Battista, Federico, Rossi, Fabrizio, Smriglio, Stefano
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Information Theory 90C22, 90C27, 05C69
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 Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2025)

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

Practical Experience with Stable Set and Coloring Relaxations
par: Pucher, Dunja, et autres
Publié: (2024)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
par: Borgwardt, Steffen, et autres
Publié: (2025)

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
par: Clow, Alexander, et autres
Publié: (2025)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
par: Shao, Sihong, et autres
Publié: (2025)

On generalized KKT points for the Motzkin-Straus program
par: Beretta, G., et autres
Publié: (2023)

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
par: Gaar, Elisabeth
Publié: (2020)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
par: Im, Haesol, et autres
Publié: (2024)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
par: Barkel, Mathijs, et autres
Publié: (2026)

Semidefinite approximations for bicliques and biindependent pairs
par: Laurent, Monique, et autres
Publié: (2023)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
par: Sinjorgo, Lennart, et autres
Publié: (2025)

Edge expansion of a graph: SDP-based computational strategies
par: Gupte, Akshay, et autres
Publié: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
par: Xu, Mingming, et autres
Publié: (2026)

On exactness of SDP relaxation for the maximum cut problem
par: Bhardwaj, Avinash, et autres
Publié: (2025)

An Integer Linear Programming Model for the Evolomino Puzzle
par: Nikolaev, Andrei V., et autres
Publié: (2026)

Solving exact and noisy rank-one tensor completion with semidefinite programming
par: Cifuentes, Diego, et autres
Publié: (2025)

Fixed Topology Minimum-Length Trees with Neighborhoods
par: Blanco, Víctor, et autres
Publié: (2024)

A Canceling Heuristic for the Directed Traveling Salesman Problem
par: Borgwardt, Steffen, et autres
Publié: (2026)

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

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
par: Yang, Dominic, et autres
Publié: (2025)

Strong SDP based bounds on the cutwidth of a graph
par: Gaar, Elisabeth, et autres
Publié: (2023)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
par: Gaar, Elisabeth, et autres
Publié: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
par: Namchaisiri, Charles, et autres
Publié: (2024)

Applying a Random-Key Optimizer on Mixed Integer Programs
par: Chaves, Antonio A., et autres
Publié: (2026)

Performance Estimation for Smooth and Strongly Convex Sets
par: Luner, Alan, et autres
Publié: (2024)

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

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
par: Zhang, Rui-Jin, et autres
Publié: (2025)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
par: Nguyen, Vinh
Publié: (2025)

On generators of $k$-PSD closures of the positive semidefinite cone
par: Bhardwaj, Avinash, et autres
Publié: (2024)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
par: McFarland, Caleb
Publié: (2026)

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
par: Dienstbier, Jana, et autres
Publié: (2023)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
par: Huang, Queenie Yingkun, et autres
Publié: (2024)

Computational complexity of sum-of-squares bounds for copositive programs
par: Palomba, Marilena, et autres
Publié: (2025)

Sparse Polynomial Optimization with Unbounded Sets
par: Huang, Lei, et autres
Publié: (2024)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
par: Borgwardt, Steffen, et autres
Publié: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
par: Wang, Jie
Publié: (2022)

Improving Directions in Mixed Integer Bilevel Linear Optimization
par: Battista, Federico, et autres
Publié: (2025)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
par: Prakhya, Karthik, et autres
Publié: (2026)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
par: Brosch, Daniel, et autres
Publié: (2025)