SDP_S
SDP_S is an implementation of the algorithm proposed in the paper ”From Linear to Semidefinite Programming: an Algorithm to obtain Semidefinite Relaxations for Bivalent Quadratic Problems”. SDP_S has been mainly written by two students of the ENSIIE: Geraud Delaporte and Sebastien Jouteau. SDP_S is made available under the GNU General Public License version 2.
Keywords for this software
References in zbMATH (referenced in 18 articles )
Showing results 1 to 18 of 18.
Sorted by year (- Rendl, F.: Semidefinite relaxations for partitioning, assignment and ordering problems (2016)
- Galli, Laura; Letchford, Adam N.: A compact variant of the QCR method for quadratically constrained quadratic $0-1$ programs (2014)
- Gicquel, C.; Lisser, A.; Minoux, M.: An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (2014)
- Malick, Jér^ome; Roupin, Frédéric: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (2013)
- Hahn, Peter M.; Zhu, Yi-Rong; Guignard, Monique; Hightower, William L.; Saltzman, Matthew J.: A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (2012)
- Malick, Jér^ome; Roupin, Frédéric: Solving $k$-cluster problems to optimality with semidefinite programming (2012)
- Rendl, F.: Semidefinite relaxations for partitioning, assignment and ordering problems (2012)
- Mateus, Geraldo R.; Resende, Mauricio G.C.; Silva, Ricardo M.A.: GRASP with path-relinking for the generalized quadratic assignment problem (2011)
- Hahn, Peter M.; Zhu, Yi-Rong; Guignard, Monique; Smith, J.MacGregor: Exact solution of emerging quadratic assignment problems (2010)
- Pessoa, Artur Alves; Hahn, Peter M.; Guignard, Monique; Zhu, Yi-Rong: Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (2010)
- Pham Dinh, Tao; Nguyen Canh, Nam; Le Thi, Hoai An: An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs (2010)
- Hahn, Peter M.; Kim, Bum-Jin; Guignard, Monique; Smith, J.MacGregor; Zhu, Yi-Rong: An algorithm for the generalized quadratic assignment problem (2008)
- Billionnet, Alain; Elloumi, Sourour: Using a mixed integer quadratic programming solver for the unconstrained quadratic $0-1$ problem (2007)
- Faye, Alain; Roupin, Frédéric: Partial Lagrangian relaxation for general quadratic programming (2007)
- Loiola, Eliane Maria; De Abreu, Nair Maria Maia; Boaventura-Netto, Paulo Oswaldo; Hahn, Peter; Querido, Tania: A survey for the quadratic assignment problem (2007)
- Costa, Marie-Christine; Létocart, Lucas; Roupin, Frédéric: Minimal multicut and maximal integer multiflow: a survey (2005)
- Faye, Alain; Roupin, Frédéric: A cutting planes algorithm based upon a semidefinite relaxation for the quadratic assignment problem (2005)
- Roupin, Frédéric: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (2004)