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

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

1 2 3 ... 132 133 134 next

  1. Abdolali, Maryam; Gillis, Nicolas: Simplex-structured matrix factorization: sparsity-based identifiability and provably correct algorithms (2021)
  2. Ahmadian, Mohammad Mahdi; Salehipour, Amir; Cheng, T. C. E.: A meta-heuristic to solve the just-in-time job-shop scheduling problem (2021)
  3. Álvarez-Miranda, Eduardo; Sinnl, Markus: Exact and heuristic algorithms for the weighted total domination problem (2021)
  4. Antoine Prouvost, Justin Dumouchelle, Maxime Gasse, Didier Chételat, Andrea Lodi: Ecole: A Library for Learning Inside MILP Solvers (2021) arXiv
  5. Arık, Oğuzhan Ahmet: Long-term plantation and harvesting planning for industrial plantation forest areas (2021)
  6. Baggio, Andrea; Carvalho, Margarida; Lodi, Andrea; Tramontani, Andrea: Multilevel approaches for the critical node problem (2021)
  7. Behnamian, Javad; Ghomi, Seyyed Mohammad Taghi Fatemi: Multi-objective multi-factory scheduling (2021)
  8. Bergman, David; Lozano, Leonardo: Decision diagram decomposition for quadratically constrained binary optimization (2021)
  9. Casazza, Marco; Ceselli, Alberto: Optimization algorithms for resilient path selection in networks (2021)
  10. Casazza, Marco; Ceselli, Alberto; Wolfler Calvo, Roberto: A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (2021)
  11. Castro, Jordi; Nasini, Stefano: A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (2021)
  12. Castro, Jordi; Sarachaga, Fernando: An online optimization-based procedure for the assignment of airplane seats (2021)
  13. Çavuş, Özlem; Kocaman, Ayse Selin; Yılmaz, Özlem: A risk-averse approach for the planning of a hybrid energy system with conventional hydropower (2021)
  14. Dandurand, Brian C.; Kim, Kibaek; Leyffer, Sven: A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems (2021)
  15. Dan, Teodora; Lodi, Andrea; Marcotte, Patrice: An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints (2021)
  16. Derpich, Ivan; Herrera, Carlos; Sepúlveda, Felipe; Ubilla, Hugo: Complexity indices for the multidimensional knapsack problem (2021)
  17. Dias, Gustavo; Liberti, Leo: Exploiting symmetries in mathematical programming via orbital independence (2021)
  18. Ding, Xiaodong; Luo, Hezhi; Wu, Huixian; Liu, Jianzhen: An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (2021)
  19. Edis, Emrah B.: Constraint programming approaches to disassembly line balancing problem with sequencing decisions (2021)
  20. Elloumi, Sourour; Hudry, Olivier; Marie, Estel; Martin, Agathe; Plateau, Agnès; Rovedakis, Stéphane: Optimization of wireless sensor networks deployment with coverage and connectivity constraints (2021)

1 2 3 ... 132 133 134 next