References in zbMATH (referenced in 35 articles )

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

1 2 next

  1. Bongartz, Dominik; Najman, Jaromił; Mitsos, Alexander: Deterministic global optimization of steam cycles using the IAPWS-IF97 model (2020)
  2. Chigarev, Vladimir; Kazakov, Alexey; Pikovsky, Arkady: Kantorovich-Rubinstein-Wasserstein distance between overlapping attractor and repeller (2020)
  3. Galabova, I. L.; Hall, J. A. J.: The `Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (2020)
  4. Rahman, Hamidur; Mahajan, Ashutosh: On the facet defining inequalities of the mixed-integer bilinear covering set (2020)
  5. Romain Montagne; David Torres Sanchez; Halvard Olsen Storbugt: VRPy: A Python package for solving a range of vehicle routing problems with a column generation approach (2020) not zbMATH
  6. Tahernejad, Sahar; Ralphs, Ted K.; DeNegre, Scott T.: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (2020)
  7. Andersson, Joel A. E.; Gillis, Joris; Horn, Greg; Rawlings, James B.; Diehl, Moritz: CasADi: a software framework for nonlinear optimization and optimal control (2019)
  8. Fukasawa, Ricardo; Poirrier, Laurent: Permutations in the factorization of simplex bases (2019)
  9. Dai, Yu-Hong; Diao, Rui; Fu, Kai: Complexity analysis and algorithm design of pooling problem (2018)
  10. Huangfu, Q.; Hall, J. A. J.: Parallelizing the dual revised simplex method (2018)
  11. Kim, Kibaek; Zavala, Victor M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (2018)
  12. Kuno, Takahito; Sano, Yoshio; Tsuruda, Takahiro: Computing Kitahara-Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm (2018)
  13. Moazzez, Babak; Soltani, Hossein: Integer programming approach to static monopolies in graphs (2018)
  14. Villegas Pico, Hugo Nestor; Aliprantis, Dionysios C.: Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs (2018)
  15. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  16. Gose, Alexander H.; Denton, Brian T.: Sequential bounding methods for two-stage stochastic programs (2016)
  17. Towhidi, Mehdi; Orban, Dominique: Customizing the solution process of COIN-OR’s linear solvers with python (2016)
  18. Rudan, János; Szederkényi, Gábor; Hangos, Katalin M.; Péni, Tamás: Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (2014)
  19. Towhidi, Mehdi; Desrosiers, Jacques; Soumis, François: The positive edge criterion within COIN-OR’s CLP (2014)
  20. Belotti, Pietro: Bound reduction using pairs of linear inequalities (2013)

1 2 next