scientific article; zbMATH DE number 1302192
zbMATH Open1052.90594MaRDI QIDQ4247459FDOQ4247459
Authors: Yinyu Ye, Dimitris Bertsimas 
Publication date: 1998
Title of this publication is not available (Why is that?)
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
multivariate normal distributionheuristicapproximation algorithmorder statisticssemidefinite relaxationsrandomization schemegraph maximum bisection problempositive semidefinite programming relaxation
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Semidefinite programming (90C22)
Cited In (20)
- Approximation algorithms for indefinite complex quadratic maximization problems
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Semi-definite relaxation algorithm of multiple knapsack problem
- 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
- Approximation algorithm for MAX DICUT with given sizes of parts
- An efficient Lagrangian smoothing heuristic for max-cut
- On approximation of max-vertex-cover
- A new discrete filled function method for solving large scale max-cut problems
- Title not available (Why is that?)
- Improved approximations for max set splitting and max NAE SAT
- Convex relaxations for mixed integer predictive control
- 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
Uses Software
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)
