The following pages link to SDP_S (Q19725):
Displaying 23 items.
- 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)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- Algorithms – ESA 2005 (Q5475892) (← links)
- Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
