Pages that link to "Item:Q1777422"
From MaRDI portal
The following pages link to From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422):
Displaying 18 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← 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)
- 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)
- 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)
- 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)