scientific article; zbMATH DE number 1302192
From MaRDI portal
Publication:4247459
Recommendations
- Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- On the optimality of the random hyperplane rounding technique for MAX CUT
Cited in
(20)- Approximation algorithms for indefinite complex quadratic maximization problems
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Semi-definite relaxation algorithm of multiple knapsack problem
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- An approximation algorithm for scheduling two parallel machines with capacity constraints.
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints
- An efficient Lagrangian smoothing heuristic for max-cut
- Approximation algorithm for MAX DICUT with given sizes of parts
- On approximation of max-vertex-cover
- A new discrete filled function method for solving large scale max-cut problems
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Convex relaxations for mixed integer predictive control
- Improved approximations for max set splitting and max NAE SAT
- A novel formulation of the max-cut problem and related algorithm
- Lagrangian smoothing heuristics for Max-cut
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Approximation algorithms for discrete polynomial optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247459)
