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

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

1 2 3 ... 123 124 125 next

  1. Alfieri, Arianna; Matta, Andrea; Pastore, Erica: The time buffer approximated buffer allocation problem: a row-column generation approach (2020)
  2. Arbex Valle, Cristiano; Beasley, John E.: Order batching using an approximation for the distance travelled by pickers (2020)
  3. Atashi Khoei, Arsham; Süral, Haldun; Tural, Mustafa Kemal: Multi-facility Green Weber problem (2020)
  4. Basso, S.; Ceselli, Alberto; Tettamanzi, Andrea: Random sampling and machine learning to understand good decompositions (2020)
  5. Bautista-Valhondo, Joaquín; Alfaro-Pozo, Rocío: Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (2020)
  6. Bayless, Sam; Kodirov, Nodir; Iqbal, Syed M.; Beschastnikh, Ivan; Hoos, Holger H.; Hu, Alan J.: Scalable constraint-based virtual data center allocation (2020)
  7. Bereg, Sergey; Mojica, Luis Gerardo; Morales, Linda; Sudborough, Hal: Constructing permutation arrays using partition and extension (2020)
  8. Berger, J.; Lo, N.; Barkaoui, M.: QUEST -- a new quadratic decision model for the multi-satellite scheduling problem (2020)
  9. Bettiol, Enrico; Létocart, Lucas; Rinaldi, Francesco; Traversi, Emiliano: A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (2020)
  10. Borghini, Fabrizio; Méndez-Díaz, Isabel; Zabala, Paula: An exact algorithm for the edge coloring by total labeling problem (2020)
  11. Costalonga, João Paulo: Toroidal boards and code covering (2020)
  12. Dahlbeck, Mirko; Fischer, Anja; Fischer, Frank: Decorous combinatorial lower bounds for row layout problems (2020)
  13. De Santis, Marianna; Grani, Giorgio; Palagi, Laura: Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (2020)
  14. do Forte, Vinicius L.; Lin, Min Chih; Lucena, Abilio; Maculan, Nelson; Moyano, Veronica A.; Szwarcfiter, Jayme L.: Modelling and solving the perfect edge domination problem (2020)
  15. Doppstadt, Christian; Koberstein, Achim; Vigo, Daniele: The hybrid electric vehicle-traveling salesman problem with time windows (2020)
  16. Drezner, Tammy; Drezner, Zvi; Kalczynski, Pawel: Directional approach to gradual cover: a maximin objective (2020)
  17. Dugošija, Djordje; Savić, Aleksandar; Maksimović, Zoran: A new integer linear programming formulation for the problem of political districting (2020)
  18. Egging-Bratseth, Ruud; Baltensperger, Tobias; Tomasgard, Asgeir: Solving oligopolistic equilibrium problems with convex optimization (2020)
  19. Firat, Murat; Crognier, Guillaume; Gabor, Adriana F.; Hurkens, C. A. J.; Zhang, Yingqian: Column generation based heuristic for learning classification trees (2020)
  20. Forghani, Asefe; Dehghanian, Farzad; Salari, Majid; Ghiami, Yousef: A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (2020)

1 2 3 ... 123 124 125 next