Pages that link to "Item:Q4427330"

The following pages link to Solving Graph Bisection Problems with Semidefinite Programming (Q4427330):

Displaying 24 items.

• Memetic search for the max-bisection problem (Q339560) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
• Quadratic convex reformulations for quadratic 0-1 programming (Q941006) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
• An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
• An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
• Graph bisection revisited (Q1657405) (← links)
• A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
• An exact algorithm for graph partitioning (Q1942271) (← links)
• Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
• Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
• A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
• Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY (Q2895762) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• (Q5140710) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)