CPLEX

IBM® ILOG® CPLEX® offers C, C++, Java, .NET, and Python libraries that solve linear programming (LP) and related problems. Specifically, it solves linearly or quadratically constrained optimization problems where the objective to be optimized can be expressed as a linear function or a convex quadratic function. The variables in the model may be declared as continuous or further constrained to take only integer values.


References in zbMATH (referenced in 1928 articles , 1 standard article )

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

1 2 3 ... 95 96 97 next

  1. Gurski, Frank; Rethmann, Jochen: Distributed solving of mixed-integer programs with GLPK and Thrift (2018)
  2. Helm, Werner E.; Justkowiak, Jan-Erik: Extension of Mittelmann’s benchmarks: comparing the solvers of SAS and Gurobi (2018)
  3. Ahmadi, Amir Ali; Hall, Georgina: Sum of squares basis pursuit with linear and second order cone programming (2017)
  4. Ait El Cadi, Abdessamad; Ben Atitallah, Rabie; Hanafi, Saïd; Mladenović, Nenad; Artiba, Abdelhakim: New MIP model for multiprocessor scheduling problem with communication delays (2017)
  5. Albrecht, Wolfgang; Steinrücke, Martin: Continuous-time production, distribution and financial planning with periodic liquidity balancing (2017)
  6. Al-Dhaheri, Noura; Diabat, Ali: A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (2017)
  7. Amir Ali Ahmadi, Anirudha Majumdar: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (2017) arXiv
  8. Asimakopoulou, Georgia E.; Vlachos, Andreas G.; Hatziargyriou, Nikos D.: Bilevel model for retail electricity pricing (2017)
  9. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
  10. Atakan, Semih; Bülbül, Kerem; Noyan, Nilay: Minimizing value-at-risk in single-machine scheduling (2017)
  11. Bekos, Michael A.; Kaufmann, Michael; Kobourov, Stephen G.; Stavropoulos, Konstantinos; Veeramoni, Sankar: The maximum $k$-differential coloring problem (2017)
  12. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  13. Bongartz, Dominik; Mitsos, Alexander: Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (2017)
  14. Boyland, Peter; Pintér, Gabriella; Laukó, István; Roth, Ivan; Schoenfield, Jon E.; Wasielewski, Stephen: On the maximum number of non-intersecting diagonals in an array (2017)
  15. Bruni, M.E.; Beraldi, P.; Conforti, D.: Water distribution networks design under uncertainty (2017)
  16. Bülbül, Kerem; Şen, Halil: An exact extended formulation for the unrelated parallel machine total weighted completion time problem (2017)
  17. Casini, M.; Garulli, A.; Vicino, A.: A linear programming approach to online set membership parameter estimation for linear regression models (2017)
  18. Cheung, Kevin K.H.; Gleixner, Ambros; Steffy, Daniel E.: Verifying integer programming results (2017)
  19. Czibula, Oliver; Gu, Hanyu; Russell, Aaron; Zinder, Yakov: A multi-stage IP-based heuristic for class timetabling and trainer rostering (2017)
  20. Dražić, Zorica; Čangalović, Mirjana; Kovačević-Vujčić, Vera: A metaheuristic approach to the dominating tree problem (2017)

1 2 3 ... 95 96 97 next