References in zbMATH (referenced in 21 articles )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Bergman, David: An exact algorithm for the quadratic multiknapsack problem with an application to event seating (2019)
  2. Liu, Zi-Long; Tian, Fang: Improved approximating (2)-CatSP for (\sigma\geq0.50) with an unbalanced rounding matrix (2016)
  3. Rendl, F.: Semidefinite relaxations for partitioning, assignment and ordering problems (2016)
  4. Galli, Laura; Letchford, Adam N.: A compact variant of the QCR method for quadratically constrained quadratic (0-1) programs (2014)
  5. Gicquel, C.; Lisser, A.; Minoux, M.: An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (2014)
  6. Billionnet, Alain: Mathematical optimization ideas for biodiversity conservation (2013)
  7. Malick, Jérôme; 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)
  8. 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)
  9. Malick, Jérôme; Roupin, Frédéric: Solving (k)-cluster problems to optimality with semidefinite programming (2012)
  10. Rendl, F.: Semidefinite relaxations for partitioning, assignment and ordering problems (2012)
  11. Mateus, Geraldo R.; Resende, Mauricio G. C.; Silva, Ricardo M. A.: GRASP with path-relinking for the generalized quadratic assignment problem (2011)
  12. Hahn, Peter M.; Zhu, Yi-Rong; Guignard, Monique; Smith, J. MacGregor: Exact solution of emerging quadratic assignment problems (2010)
  13. 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)
  14. 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)
  15. Hahn, Peter M.; Kim, Bum-Jin; Guignard, Monique; Smith, J. MacGregor; Zhu, Yi-Rong: An algorithm for the generalized quadratic assignment problem (2008)
  16. Billionnet, Alain; Elloumi, Sourour: Using a mixed integer quadratic programming solver for the unconstrained quadratic (0-1) problem (2007)
  17. Faye, Alain; Roupin, Frédéric: Partial Lagrangian relaxation for general quadratic programming (2007)
  18. Loiola, Eliane Maria; De Abreu, Nair Maria Maia; Boaventura-Netto, Paulo Oswaldo; Hahn, Peter; Querido, Tania: A survey for the quadratic assignment problem (2007)
  19. Costa, Marie-Christine; Létocart, Lucas; Roupin, Frédéric: Minimal multicut and maximal integer multiflow: a survey (2005)
  20. Faye, Alain; Roupin, Frédéric: A cutting planes algorithm based upon a semidefinite relaxation for the quadratic assignment problem (2005)

1 2 next