References in zbMATH (referenced in 18 articles )

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

  1. Chen, Zhongzhu; Fampa, Marcia; Lambert, Amélie; Lee, Jon: Mixing convex-optimization bounds for maximum-entropy sampling (2021)
  2. Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (2021)
  3. Maher, Stephen J.: Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework (2021)
  4. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
  5. Anjos, Miguel F.; Fischer, Anja; Hungerländer, Philipp: Improved exact approaches for row layout problems with departments of equal length (2018)
  6. Kim, Kibaek; Zavala, Victor M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (2018)
  7. Atakan, Semih; Bülbül, Kerem; Noyan, Nilay: Minimizing value-at-risk in single-machine scheduling (2017)
  8. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  9. Létocart, Lucas; Wiegele, Angelika: Exact solution methods for the (k)-item quadratic knapsack problem (2016)
  10. 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)
  11. Fischer, Frank; Helmberg, Christoph: Dynamic graph generation for the shortest path problem in time expanded networks (2014)
  12. 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)
  13. Bley, Andreas; Ljubić, Ivana; Maurer, Olaf: Lagrangian decompositions for the two-level FTTx network design problem (2013)
  14. Lubin, Miles; Martin, Kipp; Petra, Cosmin G.; Sandıkçı, Burhaneddin: On parallelizing dual decomposition in stochastic integer programming (2013)
  15. 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)
  16. Mittelmann, Hans D.: The state-of-the-art in conic optimization software (2012)
  17. Fischer, Frank; Helmberg, Christoph; Janßen, Jürgen; Krostitz, Boris: Towards solving very large scale train timetabling problems by Lagrangian relaxation (2008)
  18. Helmberg, C.; Röhl, S.: A case study of joint online truck scheduling and inventory management for multiple warehouses (2007)