scientific article; zbMATH DE number 1302192
From MaRDI portal
Publication:4247459
zbMath1052.90594MaRDI QIDQ4247459
Yinyu Ye, Dimitris J. Bertsimas
Publication date: 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
order statisticsapproximation algorithmheuristicsemidefinite relaxationsmultivariate normal distributionrandomization schemegraph maximum bisection problempositive semidefinite programming relaxation
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Improved approximations for max set splitting and max NAE SAT, Approximation algorithm for MAX DICUT with given sizes of parts, Approximation algorithms for discrete polynomial optimization, Approximation algorithms for indefinite complex quadratic maximization problems, An approximation algorithm for scheduling two parallel machines with capacity constraints., A new discrete filled function method for solving large scale max-cut problems, Global optimality conditions and optimization methods for quadratic integer programming problems, A discrete filled function algorithm for approximate global solutions of max-cut problems, 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, Unnamed Item, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, Semi-definite relaxation algorithm of multiple knapsack problem, An efficient Lagrangian smoothing heuristic for max-cut, Lagrangian smoothing heuristics for Max-cut, Convex relaxations for mixed integer predictive control, Approximation algorithms for MAX RES CUT with limited unbalanced constraints, A novel formulation of the max-cut problem and related algorithm, On approximation of max-vertex-cover, Mixed linear and semidefinite programming for combinatorial and quadratic optimization
Uses Software
