References in zbMATH (referenced in 11 articles )

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

  1. Kim, Kibaek; Zavala, Victor M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (2018)
  2. Atakan, Semih; Bülbül, Kerem; Noyan, Nilay: Minimizing value-at-risk in single-machine scheduling (2017)
  3. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  4. Létocart, Lucas; Wiegele, Angelika: Exact solution methods for the $k$-item quadratic knapsack problem (2016)
  5. 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)
  6. 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)
  7. Bley, Andreas; Ljubić, Ivana; Maurer, Olaf: Lagrangian decompositions for the two-level FTTx network design problem (2013)
  8. 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)
  9. Mittelmann, Hans D.: The state-of-the-art in conic optimization software (2012)
  10. Fischer, Frank; Helmberg, Christoph; Janßen, Jürgen; Krostitz, Boris: Towards solving very large scale train timetabling problems by Lagrangian relaxation (2008)
  11. Helmberg, C.; Röhl, S.: A case study of joint online truck scheduling and inventory management for multiple warehouses (2007)