Spectral bounds for unconstrained (- 1,1)-quadratic optimization problems
From MaRDI portal
Publication:992570
DOI10.1016/J.EJOR.2010.02.042zbMATH Open1205.90213OpenAlexW2026101846MaRDI QIDQ992570FDOQ992570
Authors: Walid Ben-Ameur, José Neto 
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.042
Recommendations
- New bounds on the unconstrained quadratic integer programming problem
- scientific article; zbMATH DE number 1054751
- Spectral bounds for the maximum cut problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
Cites Work
- Title not available (Why is that?)
- Selected Topics in Column Generation
- Paths in graphs
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Via Minimization with Pin Preassignments and Layer Preference
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Laplacian eigenvalues and the maximum cut problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- The cut polytope and the Boolean quadric polytope
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Title not available (Why is that?)
- A polynomial case of unconstrained zero-one quadratic optimization
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- Combinatorial properties and the complexity of a max-cut approximation
- Spectral bounds for the maximum cut problem
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Title not available (Why is that?)
- On the integrality ratio of semidefinite relaxations of MAX CUT
Cited In (10)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- Spectral aspect subconvex bounds for \(U_{n+1} \times U_n\)
- Spectral bounds for graph partitioning with prescribed partition sizes
- A class of spectral bounds for max \(k\)-cut
- A continuous method for computing bounds in integer quadratic optimization problems
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
- Bounds for random binary quadratic programs
- From Graph Orientation to the Unweighted Maximum Cut
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
Uses Software
This page was built for publication: Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992570)
