References in zbMATH (referenced in 12 articles )

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

  1. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
  2. Kim, Kibaek; Zavala, Victor M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (2018)
  3. Atakan, Semih; Bülbül, Kerem; Noyan, Nilay: Minimizing value-at-risk in single-machine scheduling (2017)
  4. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  5. Létocart, Lucas; Wiegele, Angelika: Exact solution methods for the (k)-item quadratic knapsack problem (2016)
  6. Guo, Ge; Hackebeil, Gabriel; Ryan, Sarah M.; Watson, Jean-Paul; Woodruff, David L.: Integration of progressive hedging and dual decomposition in stochastic integer programs (2015)
  7. Anjos, Miguel F.; Ghaddar, Bissan; Hupp, Lena; Liers, Frauke; Wiegele, Angelika: Solving (k)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method (2013)
  8. Bley, Andreas; Ljubić, Ivana; Maurer, Olaf: Lagrangian decompositions for the two-level FTTx network design problem (2013)
  9. Armbruster, Michael; Fügenschuh, Marzena; Helmberg, Christoph; Martin, Alexander: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (2012)
  10. Mittelmann, Hans D.: The state-of-the-art in conic optimization software (2012)
  11. Fischer, Frank; Helmberg, Christoph; Janßen, Jürgen; Krostitz, Boris: Towards solving very large scale train timetabling problems by Lagrangian relaxation (2008)
  12. Helmberg, C.; Röhl, S.: A case study of joint online truck scheduling and inventory management for multiple warehouses (2007)