swMATH7708MaRDI QIDQ19725FDOQ19725
Author name not available (Why is that?)
Official website: http://deptinfo.cnam.fr/~roupinf/SDPS/
Cited In (26)
- Partial Lagrangian relaxation for general quadratic programming
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Minimal multicut and maximal integer multiflow: a survey
- Algorithms – ESA 2005
- A survey for the quadratic assignment problem
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- An algorithm for the generalized quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- GRASP_QAP
- MULKNAP
- SBmethod
- Taking advantage of symmetry in some quadratic assignment problems
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- GRASP with path-relinking for the generalized quadratic assignment problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Exact solution of emerging quadratic assignment problems
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Mathematical optimization ideas for biodiversity conservation
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
This page was built for software: SDP_S
