Pages that link to "Item:Q1403298"
From MaRDI portal
The following pages link to Stronger linear programming relaxations of max-cut (Q1403298):
Displaying 19 items.
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- On the linear relaxation of the \(s-t\)-cut problem with budget constraints (Q2225051) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm (Q3167623) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- (Q3801338) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
