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

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

1 2 3 ... 105 106 107 next

  1. Akgün, İbrahim; Tansel, Barbaros Ç.: $p$-hub median problem for non-complete networks (2018)
  2. Anjos, Miguel F.; Fischer, Anja; Hungerländer, Philipp: Improved exact approaches for row layout problems with departments of equal length (2018)
  3. Asef-Vaziri, Ardavan; Kazemi, Morteza: Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (2018)
  4. Balma, Ali; Salem, Safa Ben; Mrad, Mehdi; Ladhari, Talel: Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (2018)
  5. Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2018)
  6. Bertsimas, Dimitris; Georghiou, Angelos: Binary decision rules for multistage adaptive mixed-integer optimization (2018)
  7. Boland, Natashia; Christiansen, Jeffrey; Dandurand, Brian; Eberhard, Andrew; Linderoth, Jeff; Luedtke, James; Oliveira, Fabricio: Combining progressive hedging with a Frank-Wolfe method to compute Lagrangian dual bounds in stochastic mixed-integer programming (2018)
  8. Buchheim, Christoph; De Santis, Marianna; Rinaldi, Francesco; Trieu, Long: A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (2018)
  9. Bulutoglu, Dursun A.; Ryan, Kenneth J.: Integer programming for classifying orthogonal arrays (2018)
  10. Bychkov, Ilya; Batsyn, Mikhail: An efficient exact model for the cell formation problem with a variable number of production cells (2018)
  11. Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong: Generalized coefficient strengthening cuts for mixed integer programming (2018)
  12. Constantino, Miguel; Martins, Isabel: Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (2018)
  13. Coudert, David; Ducoffe, Guillaume; Nisse, Nicolas; Soto, Mauricio: On distance-preserving elimination orderings in graphs: complexity and algorithms (2018)
  14. Cunha, Artur Lovato; Oliveira dos Santos, Maristela; Morabito, Reinaldo; Barbosa-Póvoa, Ana: An integrated approach for production lot sizing and raw material purchasing (2018)
  15. Dalkiran, Evrim; Ghalami, Laleh: On linear programming relaxations for solving polynomial programming problems (2018)
  16. Dash, Sanjeeb; Günlük, Oktay; Hildebrand, Robert: Binary extended formulations of polyhedral mixed-integer sets (2018)
  17. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  18. Dey, Santanu S.; Iroume, Andres; Molinaro, Marco; Salvagnin, Domenico: Improving the randomization step in feasibility pump (2018)
  19. Escudero, Laureano F.; Garín, María Araceli; Pizarro, Celeste; Unzueta, Aitziber: On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (2018)
  20. Freeman, Nickolas K.; Keskin, Burcu B.; Çapar, İbrahim: Attractive orienteering problem with proximity and timing interactions (2018)

1 2 3 ... 105 106 107 next