Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
From MaRDI portal
(Redirected from Publication:1290621)
Recommendations
Cites work
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 780784 (Why is no real title available?)
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- An Interior-Point Method for Semidefinite Programming
- An algorithm for quadratic zero-one programs
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Combinatorial properties and the complexity of a max-cut approximation
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Experiments in quadratic 0-1 programming
- Geometry of cuts and metrics
- Laplacian eigenvalues and the maximum cut problem
- Node and edge relaxations of the max-cut problem
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- On a positive semidefinite relaxation of the cut polytope
- On the Facial Structure of the Set of Correlation Matrices
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Solving the max-cut problem using eigenvalues
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- The cut polytope and the Boolean quadric polytope
- The expected relative error of the polyhedral approximation of the max- cut problem
- The hypermetric cone is polyhedral
- The indefinite zero-one quadratic problem
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The max-cut problem on graphs not contractible to \(K_ 5\)
Cited in
(83)- An improved interior-point cutting-plane method for binary quadratic optimization
- Bounds for random binary quadratic programs
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- A guide to conic optimisation and its applications
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- An entropy-regularized ADMM for binary quadratic programming
- scientific article; zbMATH DE number 1046860 (Why is no real title available?)
- A framework for solving mixed-integer semidefinite programs
- A new global algorithm for max-cut problem with chordal sparsity
- A note on the 2-circulant inequalities for the MAX-cut problem
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Introduction to QUBO
- A preconditioned iterative interior point approach to the conic bundle subproblem
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Predictive control for hybrid systems. Implications of polyhedral pre-computations
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- On characterization of maximal independent sets via quadratic optimization
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Stochastic nuclear outages semidefinite relaxations
- The unconstrained binary quadratic programming problem: a survey
- Two-stage quadratic integer programs with stochastic right-hand sides
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Extending the QCR method to general mixed-integer programs
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- An active-set method for second-order conic-constrained quadratic programming
- Ellipsoid bounds for convex quadratic integer programming
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Convex relaxations for mixed integer predictive control
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Experiments in quadratic 0-1 programming
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Disjunctive Cuts for Nonconvex MINLP
- A new separation algorithm for the Boolean quadric and cut polytopes
- Computational approaches to MAX-cut
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Parametric Lagrangian dual for the binary quadratic programming problem
- Building an iterative heuristic solver for a quantum annealer
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Algorithms – ESA 2005
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- ``Miniaturized linearizations for quadratic 0/1 problems
- Manifold relaxations for integer programming
- Certifiably optimal sparse inverse covariance estimation
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A linearization framework for unconstrained quadratic (0-1) problems
- Calmness of partial perturbation to composite rank constraint systems and its applications
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Stochastic quadratic knapsack with recourse
- Solving Quadratic Programming by Cutting Planes
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Mathematical programming models and exact algorithms
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- The Boolean quadric polytope
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Cuts for mixed 0-1 conic programming
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Continuous representations and functional extensions in combinatorial optimization
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Quadratic reformulations of nonlinear binary optimization problems
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Knapsack problem with probability constraints
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
This page was built for publication: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290621)
