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

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

1 2 3 ... 107 108 109 next

  1. Briskorn, Dirk; Dienstknecht, Michael: Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference (2019)
  2. Kress, Dominik; Dornseifer, Jan; Jaehn, Florian: An exact solution approach for scheduling cooperative gantry cranes (2019)
  3. Nowak, Maciek; Hewitt, Mike; Bachour, Hussam: Mileage bands in freight transportation (2019)
  4. Reihaneh, Mohammad; Ghoniem, Ahmed: A branch-and-price algorithm for a vehicle routing with demand allocation problem (2019)
  5. Taş, Duygu; Gendreau, Michel; Jabali, Ola; Jans, Raf: A capacitated lot sizing problem with stochastic setup times and overtime (2019)
  6. Akgün, İbrahim; Tansel, Barbaros Ç.: $p$-hub median problem for non-complete networks (2018)
  7. Alavi, E. S.; Ghanbari, R.: A limited resource assignment problem with shortage in the fire department (2018)
  8. Anjos, Miguel F.; Fischer, Anja; Hungerländer, Philipp: Improved exact approaches for row layout problems with departments of equal length (2018)
  9. Asef-Vaziri, Ardavan; Kazemi, Morteza: Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (2018)
  10. Balma, Ali; Salem, Safa Ben; Mrad, Mehdi; Ladhari, Talel: Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (2018)
  11. Bart, Anicet; Delahaye, Beno^ıt; Fournier, Paulin; Lime, Didier; Monfroy, Éric; Truchet, Charlotte: Reachability in parametric interval Markov chains using constraints (2018)
  12. Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2018)
  13. Bertsimas, Dimitris; Georghiou, Angelos: Binary decision rules for multistage adaptive mixed-integer optimization (2018)
  14. 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)
  15. Buchheim, Christoph; De Santis, Marianna; Rinaldi, Francesco; Trieu, Long: A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (2018)
  16. Bulutoglu, Dursun A.; Ryan, Kenneth J.: Integer programming for classifying orthogonal arrays (2018)
  17. Bychkov, Ilya; Batsyn, Mikhail: An efficient exact model for the cell formation problem with a variable number of production cells (2018)
  18. Carvalho, Desiree M.; Nascimento, Mariá C. V.: A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (2018)
  19. Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong: Generalized coefficient strengthening cuts for mixed integer programming (2018)
  20. Constantino, Miguel; Martins, Isabel: Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (2018)

1 2 3 ... 107 108 109 next