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

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

1 2 3 ... 124 125 126 next

  1. Alfieri, Arianna; Matta, Andrea; Pastore, Erica: The time buffer approximated buffer allocation problem: a row-column generation approach (2020)
  2. Aparicio, Juan; Kapelko, Magdalena; Monge, Juan F.: A well-defined composite indicator: an application to corporate social responsibility (2020)
  3. Arbex Valle, Cristiano; Beasley, John E.: Order batching using an approximation for the distance travelled by pickers (2020)
  4. Atashi Khoei, Arsham; Süral, Haldun; Tural, Mustafa Kemal: Multi-facility Green Weber problem (2020)
  5. Basso, S.; Ceselli, Alberto; Tettamanzi, Andrea: Random sampling and machine learning to understand good decompositions (2020)
  6. 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)
  7. Bayless, Sam; Kodirov, Nodir; Iqbal, Syed M.; Beschastnikh, Ivan; Hoos, Holger H.; Hu, Alan J.: Scalable constraint-based virtual data center allocation (2020)
  8. Bereg, Sergey; Mojica, Luis Gerardo; Morales, Linda; Sudborough, Hal: Constructing permutation arrays using partition and extension (2020)
  9. Berger, J.; Lo, N.; Barkaoui, M.: QUEST -- a new quadratic decision model for the multi-satellite scheduling problem (2020)
  10. 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)
  11. Borghini, Fabrizio; Méndez-Díaz, Isabel; Zabala, Paula: An exact algorithm for the edge coloring by total labeling problem (2020)
  12. Briheche, Yann; Barbaresco, Frederic; Bennis, Fouad; Chablat, Damien: Branch-and-bound method for just-in-time optimization of radar search patterns (2020)
  13. Briskorn, Dirk; Zey, Lennart: Interference aware scheduling of triple-crossover-cranes (2020)
  14. Coey, Chris; Lubin, Miles; Vielma, Juan Pablo: Outer approximation with conic certificates for mixed-integer convex problems (2020)
  15. Costalonga, João Paulo: Toroidal boards and code covering (2020)
  16. Dahlbeck, Mirko; Fischer, Anja; Fischer, Frank: Decorous combinatorial lower bounds for row layout problems (2020)
  17. D’Ambrosio, Claudia; Liberti, Leo; Poirion, Pierre-Louis; Vu, Ky: Random projections for quadratic programs (2020)
  18. Del Pia, Alberto; Khajavirad, Aida; Sahinidis, Nikolaos V.: On the impact of running intersection inequalities for globally solving polynomial optimization problems (2020)
  19. De Santis, Marianna; Grani, Giorgio; Palagi, Laura: Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (2020)
  20. 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)

1 2 3 ... 124 125 126 next