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 2007 articles , 1 standard article )

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

1 2 3 ... 99 100 101 next

  1. Asef-Vaziri, Ardavan; Kazemi, Morteza: Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (2018)
  2. Bertsimas, Dimitris; Georghiou, Angelos: Binary decision rules for multistage adaptive mixed-integer optimization (2018)
  3. Buchheim, Christoph; De Santis, Marianna; Rinaldi, Francesco; Trieu, Long: A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (2018)
  4. Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong: Generalized coefficient strengthening cuts for mixed integer programming (2018)
  5. Constantino, Miguel; Martins, Isabel: Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (2018)
  6. Dey, Santanu S.; Iroume, Andres; Molinaro, Marco; Salvagnin, Domenico: Improving the randomization step in feasibility pump (2018)
  7. Gurski, Frank; Rethmann, Jochen: Distributed solving of mixed-integer programs with GLPK and Thrift (2018)
  8. Helm, Werner E.; Justkowiak, Jan-Erik: Extension of Mittelmann’s benchmarks: comparing the solvers of SAS and Gurobi (2018)
  9. Lancia, Giuseppe; Serafini, Paolo: Compact extended linear programming models (2018)
  10. Mazidi, Peyman; Tohidi, Yaser; Ramos, Andres; Sanz-Bobi, Miguel A.: Profit-maximization generation maintenance scheduling through bi-level programming (2018)
  11. Munguía, Lluís-Miquel; Ahmed, Shabbir; Bader, David A.; Nemhauser, George L.; Shao, Yufen: Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (2018)
  12. Noyan, Nilay; Kahvecioğlu, Gökçe: Stochastic last mile relief network design with resource reallocation (2018)
  13. Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)
  14. Ahmadi, Amir Ali; Hall, Georgina: Sum of squares basis pursuit with linear and second order cone programming (2017)
  15. 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)
  16. Albrecht, Wolfgang; Steinrücke, Martin: Continuous-time production, distribution and financial planning with periodic liquidity balancing (2017)
  17. Al-Dhaheri, Noura; Diabat, Ali: A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (2017)
  18. Amir Ali Ahmadi, Anirudha Majumdar: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (2017) arXiv
  19. Aráoz, Julián; Fernández, Elena; Franquesa, Carles: The generalized arc routing problem (2017)
  20. Asimakopoulou, Georgia E.; Vlachos, Andreas G.; Hatziargyriou, Nikos D.: Bilevel model for retail electricity pricing (2017)

1 2 3 ... 99 100 101 next