The following pages link to (Q4247459):
Displaying 20 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
- Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)
- (Q5054600) (← links)
